Star-factors in graphs of high degree

Abstract

We prove that every graph with sufficiently large minimum degree $d$ contains a spanning forest in which every component is a star of size at least $\sqrt{d}-\tilde{O}(d^{1/4})$. This improves the result of Alon and Wormald and is optimal up to the lower order term.