On the Number of Hamilton Cycles in Pseudo-Random Graphs

[摘要] 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:

[学科分类] 离散数学和组合数学