Star-factors in graphs with large minimum degree

We prove that every graph of minimum degree d contains a spanning forest in which every component is a star of size at least d−O˜(d1/4). This improves a result of Alon and Wormald and is optimal up to the lower order term.