Pancyclicity of Hamiltonian graphs

MaRDI QIDQ6410027zbMATH OpenFDO

Authors Nemanja Draganić, David Munhá Correia, Benny Sudakov

Publication date 7 September 2022

Abstract: 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, ErdH{o}s conjectured that every Hamiltonian graph with independence number at most $k$ and at least $n=Omega(k^2)$ vertices is pancyclic. In this paper we prove this old conjecture in a strong form by showing that if such a graph has $n=(2+o(1))k^2$ vertices, it is already pancyclic, and this bound is asymptotically best possible.

This page was built for publication: Pancyclicity of Hamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6410027)