If $G$ is a more than one tough graph on $n$ vertices with $\delta\ge \frac{n}{2}-a$ for a given $a>0$ and $n$ is large enough then $G$ is hamiltonian.
A Size Bound for Hamilton Cycles
Existence of $2$-Factors in Tough Graphs without Forbidden Subgraphs
Hamilton cycles in 3-out
![QR code for arXiv:1209.6149 [math.CO]](http://oss.arxitics.com/images/favicon.svg)