Hamilton cycles in highly connected and expanding graphs (Q624184)

Denote by \(V\) the vertex set of a graph \(G\), \(n=| V| \), and set \(m=(\log n\cdot\log\log\log n)/(\log\log n\cdot \log d)\). Consider the following properties. {\parindent=1cm \begin{itemize}\item[P1:]For every \(S\subset V\), if \(| S| \leq n/(dm)\), then \(| N(S)| \geq d| S| \). \item[P2:]There is an edge in \(G\) between any two disjoint subsets \(A,B\subseteq V\) such that \(| A| ,| B| \geq(n/4130m)\). \end{itemize}} In this paper, it is proved that, if \(d\) satisfies \(12\leq d\leq e^{\root{3}\of{\log n}}\), the graph \(G\) satisfies P1 and P2 and \(n\) is big enough, then \(G\) is Hamiltonian. This theorem implies corollaries about pancyclicity, Hamiltonian connectivity, etc.