Proves a rainbow blow-up lemma for almost optimally bounded edge-colorings, implying existence of rainbow copies of any bounded-degree spanning subgraph in a quasirandom host graph under an asymptotically best-possible coloring boundedness condition.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
Proves that bounded-degeneracy graphs with many leaves pack perfectly into dense quasirandom graphs under stated degree and size conditions, settling two tree-packing conjectures for almost all instances.
citing papers explorer
-
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Proves a rainbow blow-up lemma for almost optimally bounded edge-colorings, implying existence of rainbow copies of any bounded-degree spanning subgraph in a quasirandom host graph under an asymptotically best-possible coloring boundedness condition.
-
Perfectly packing graphs with bounded degeneracy and many leaves
Proves that bounded-degeneracy graphs with many leaves pack perfectly into dense quasirandom graphs under stated degree and size conditions, settling two tree-packing conjectures for almost all instances.