For every fixed epsilon, with high probability the random d-regular graph contains a vertex-partition into copies of any prescribed tree of size at most (1-epsilon)d/ln d.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Tree tilings in random regular graphs
For every fixed epsilon, with high probability the random d-regular graph contains a vertex-partition into copies of any prescribed tree of size at most (1-epsilon)d/ln d.