Tree tilings in random regular graphs

Abstract

We show that for every $\hat{I}\mu >0$ there exists a sufficiently large $d_0\in \mathbb{N}$ such that for every $d\ge d_0$, whp the random $d$-regular graph $G(n,d)$ contains a $T$-factor for every tree $T$ on at most $(1-\hat{I}\mu )d/\ln d$ vertices. This is best possible since, for large enough integer $d$, whp $G(n,d)$ does not contain a $\frac{(1+\hat{I}\mu )d}{\ln d}$-star-factor. Our method gives a randomised algorithm which whp finds said $T$-factor and whose expected running time is $O(n^{1+o(1)})$, as well as an efficient deterministic counterpart.