Long cycles in graphs through fragments

Abstract

Four basic Dirac-type sufficient conditions for a graph $G$ to be hamiltonian are known involving order $n$, minimum degree $δ$, connectivity $κ$ and independence number $α$ of $G$: (1) $δ\geq n/2$ (Dirac); (2) $κ\geq 2$ and $δ\geq (n+κ)/3$ (by the author); (3) $κ\geq 2$ and $δ\geq \max\lbrace (n+2)/3,α\rbrace$ (Nash-Williams); (4) $κ\geq 3$ and $δ\geq \max\lbrace (n+2κ)/4,α\rbrace$ (by the author). In this paper we prove the reverse version of (4) concerning the circumference $c$ of $G$ and completing the list of reverse versions of (1)-(4): (R1) if $κ\geq 2$, then $c\geq\min\lbrace n,2δ\rbrace$ (Dirac); (R2) if $κ\geq 3$, then $c\geq\min\lbrace n,3δ-κ\rbrace$ (by the author); (R3) if $κ\geq 3$ and $δ\geq α$, then $c\geq\min\lbrace n,3δ-3\rbrace$ (Voss and Zuluaga); (R4) if $κ\geq 4$ and $δ\geq α$, then $c\geq\min\lbrace n,4δ-2κ\rbrace$. To prove (R4), we present four more general results centered around a lower bound $c\geq 4δ-2κ$ under four alternative conditions in terms of fragments. A subset $X$ of $V(G)$ is called a fragment of $G$ if $N(X)$ is a minimum cut-set and $V(G)-(X\cup N(X))\neq\emptyset$.