2-factors with k cycles in Hamiltonian graphs

Matija Bucić, Erik Jahn, Alexey Pokrovskiy +1

A well known generalisation of Dirac's theorem states that if a graph $G$ on $n\ge 4k$ vertices has minimum degree at least $n/2$ then $G$ contains a $2$-factor consisting of exact…