2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/171338We 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 $Ω((d/\log d)^{1/3})$. This settles a problem of J. Kratochvil.Combinatorics05C35text