Improved degree conditions for 2-factors with k cycles in hamiltonian graphs

We improve on this result, giving an elementary proof that for every ε>0 and k≥1, if G is a hamiltonian graph on n≥3kε vertices with δ(G)≥(25+ε)n, then G contains a 2-factor with k cycles.