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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.