A rainbow blow-up lemma for almost optimally bounded edge-colourings

DOI10.1017/fms.2020.38zbMath1473.05086arXiv1907.09950OpenAlexW2981332286WikidataQ124840251 ScholiaQ124840251MaRDI QIDQ5135407

Stefan Glock, Felix Joos, Stefan Ehard

Publication date: 20 November 2020

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.09950

zbMATH Keywords

blow-up lemmarainbow colourings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial aspects of packing and covering (05B40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph designs and isomorphic decomposition (05C51)

Related Items (7)

The \(n\)-queens completion problem ⋮ Graph Tilings in Incompatibility Systems ⋮ Constrained Ramsey numbers for the loose path, cycle and star ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Repeated Patterns in Proper Colorings ⋮ Pseudorandom hypergraph matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Harmonious order of graphs
• On a packing and covering problem
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• Orthogonal double covers of complete graphs by trees
• A dynamic survey of graph labeling
• Counting designs
• 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
• Resolution of the Oberwolfach problem
• The minimum degree threshold for perfect graph packings
• Embedding rainbow trees with applications to graph labelling and decomposition
• A proof of Ringel's conjecture
• Optimal packings of bounded degree trees
• Packing degenerate graphs
• Properly coloured copies and rainbow copies of large graphs with small maximum degree
• A hypergraph blow-up lemma
• On Additive Bases and Harmonious Graphs
• A blow-up lemma for approximate decompositions
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• Decompositions into spanning rainbow structures
• Pseudorandom hypergraph matchings
• Almost all trees are almost graceful
• A rainbow blow‐up lemma
• Rainbow structures in locally bounded colorings of graphs
• A rainbow blow-up lemma for almost optimally bounded edge-colourings
• Rainbow matchings in Dirac bipartite graphs
• An Extension of the Blow-up Lemma to Arrangeable Graphs
• Almost Every Tree With m Edges Decomposes K_2m,2m
• On the Bollobás–Eldridge Conjecture for Bipartite Graphs
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• Proof of the Alon-Yuster conjecture

This page was built for publication: A rainbow blow-up lemma for almost optimally bounded edge-colourings