加载中…
We prove that, for large , every -connected -regular graph on vertices with is Hamiltonian. This is best possible and confirms a conjecture posed independently by Bollob'as and H"aggkvist in the 1970s. The proof builds on a structural decomposition result proved recently by the same authors.

生成讲解博客的中文版本

生成AI智能校验的中文版本