On the number of Hamilton cycles in pseudo-random graphs (Q426784)

Summary: We prove that if \(G\) is an \((n,d,\lambda)\)-graph (a \(d\)-regular graph on \(n\) vertices, all of whose non-trivial eigenvalues are at most \(\lambda)\) and the following conditions are satisfied: {\parindent=6mm \begin{itemize}\item[1)]\(\frac{d}{\lambda}\geq (\log n)^{1+\epsilon}\) for some constant \(\epsilon>0\) and \item[2)]\(\log d\cdot \log\frac{d}{\lambda}\gg \log n\), then the number of Hamilton cycles in \(G\) is \(n!\left(\frac{d}{n}\right)^n(1+o(1))^n\). \end{itemize}}