High degree graphs contain large-star factors
  We show that any finite simple graph with minimum degree $d$ contains a spanning star forest in which every connected component is of size at least $\Omega((d/\log d)^{1/3})$. This settles a problem of J. Kratochvil. 
Noga Alon and Nicholas Wormald