Chv\'atal-Erdos condition for pancyclicity
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. A celebrated meta-conjecture of Bondy states that every non-trivial condition implying Hamiltonicity also implies pancyclicity (up to possibly a few exceptional graphs). We show that every graph G with (G) > (1+o(1)) α(G) is pancyclic. This extends the famous Chv\'atal-Erdos condition for Hamiltonicity and proves asymptotically a 30-year old conjecture of Jackson and Ordaz.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.