Hamiltonicity of C-expanders
Determine whether, for every sufficiently large constant C > 0, every n-vertex graph satisfying the C-expansion properties (|N(X)| ≥ C|X| for all X with |X| < n/(2C) and an edge between any two disjoint sets of size at least n/(2C)) is Hamiltonian.
References
Conjecture 1.3. For every sufficiently large C > 0, every C-expander is Hamiltonian.
It is natural to ask whether the logarithmic-square scale is already sufficient on the positive side.
\begin{problem} For every $\varepsilon>0$, does there exist $C=C(\varepsilon)>0$ such that every sufficiently large $n$-vertex $d$-regular $(\varepsilon,d)$-expander with $d\ge C\log2 n$ contains a Hamilton cycle? \end{problem}
Is it true that for every\ $C\in $, the family of finite C\ graphs is asymptotically\ hamiltonian? Is it weakly hamiltonian?