Abstract
Abstract
A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Komlós, Sárközy, and Szemerédi that applies to almost optimally bounded colourings. A corollary of this is that there exists a rainbow copy of any bounded-degree spanning subgraph H in a quasirandom host graph G, assuming that the edge-colouring of G fulfills a boundedness condition that is asymptotically best possible.
This has many applications beyond rainbow colourings: for example, to graph decompositions, orthogonal double covers, and graph labellings.
Publisher
Cambridge University Press (CUP)
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Mathematical Physics,Statistics and Probability,Algebra and Number Theory,Theoretical Computer Science,Analysis
Reference44 articles.
1. [26] Keevash, P. , ‘The existence of designs’, arXiv:1401.3665 (2014).
2. Hamilton decompositions of regular expanders: A proof of Kelly’s conjecture for large tournaments
3. Rainbow structures in locally bounded colorings of graphs
4. [18] Glock, S. , Joos, F. , Kim, J. , Kühn, D. , and Osthus, D. , ‘Resolution of the Oberwolfach problem’, arXiv:1806.04644 (2018).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献