A rainbow blow‐up lemma
From MaRDI portal
Publication:5128752
DOI10.1002/rsa.20907zbMath1458.05067arXiv1802.07700OpenAlexW3006754732WikidataQ124803180 ScholiaQ124803180MaRDI QIDQ5128752
Publication date: 26 October 2020
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.07700
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Graph Tilings in Incompatibility Systems ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ A Rainbow Dirac's Theorem ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ The bandwidth theorem for locally dense graphs ⋮ Repeated Patterns in Proper Colorings ⋮ Rainbow factors in hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polychromatic Hamilton cycles
- Linearly many rainbow trees in properly edge-coloured complete graphs
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Using Lovász local lemma in the space of random injections
- On rainbow trees and cycles
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Proof of the Seymour conjecture for large graphs
- Covering with Latin transversals
- Blow-up lemma
- An approximate version of a conjecture of Aharoni and Berger
- Rainbow spanning trees in properly coloured complete graphs
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree
- Multicoloured Hamilton cycles
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- The minimum degree threshold for perfect graph packings
- Long directed rainbow cycles and rainbow spanning trees
- Embedding rainbow trees with applications to graph labelling and decomposition
- Optimal packings of bounded degree trees
- Bounded colorings of multipartite graphs and hypergraphs
- Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs
- Properly coloured copies and rainbow copies of large graphs with small maximum degree
- Rainbow Matchings in Properly Colored Multigraphs
- A constructive proof of the general lovász local lemma
- Hamilton circuits with many colours in properly edge-coloured complete graphs.
- A blow-up lemma for approximate decompositions
- Proof of a Packing Conjecture of Bollobás
- Decompositions into spanning rainbow structures
- Rainbow matchings in Dirac bipartite graphs
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- Constraint satisfaction, packet routing, and the lovasz local lemma
- Properly colored and rainbow copies of graphs with few cherries
- A lower bound for the length of a partial transversal in a Latin square
- Proof of the Alon-Yuster conjecture
