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

MaRDI QIDQ6621195

Stefan Ehard, Stefan Glock, Felix Joos

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• 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
• Embedding rainbow trees with applications to graph labelling and decomposition
• Optimal packings of bounded degree trees
• Properly coloured copies and rainbow copies of large graphs with small maximum degree
• A hypergraph blow-up lemma
• A blow-up lemma for approximate decompositions
• Decompositions into spanning rainbow structures
• 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
• Proof of the Alon-Yuster conjecture

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621195)