Pancyclicity of Hamiltonian graphs

Nemanja Draganić, David Munhá Correia, Benny Sudakov

An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is pancyclic if it contains cycles of all lengths from $3$ up to $n$. In 1972, Erd…