Long Cycles in Hamiltonian Graphs

Abstract

We prove that if an n-vertex graph with minimum degree at least 3 contains a Hamiltonian cycle, then it contains another cycle of length n− o(n); in particular, this verifies, in an asymptotic form, a well-known conjecture due to Sheehan from 1975. 

1 Figure or Table

Topics

  • Presentations referencing similar topics