Montgomery’s Hamiltonicity conjecture for regular sublinear expanders

For every sufficiently large integer dd and every sufficiently large nn, every nn-vertex dd-regular sublinear expander contains a Hamiltonian cycle.

References

Primary source

arXiv

Progress summary

Refreshed
Claimed solved

An unrefereed August 2026 preprint claims to disprove the conjecture by constructing regular expanders without Hamiltonian cycles at the log-squared degree scale.

Montgomery’s conjecture asks whether the relevant regular sublinear expanders universally contain a Hamiltonian cycle. The latest report says this universal statement is false and identifies the log-squared degree scale as an obstruction.

Known results

  • Draganić, Montgomery, Munhá Correia, Pokrovskiy, and Sudakov, 2024: every sufficiently strong constant-expansion graph is Hamiltonian.
  • Glock, Munhá Correia, and Sudakov, 2023: Hamiltonicity was proved under the weaker pseudorandomness condition d/λ≥Clog⁡1/3nd/\lambda \geq C\log^{1/3} n.
  • Montgomery, 2026 and collaborators: regular γ\gamma-expanders with d≥(γ−1log⁡n)Kd\geq(\gamma^{-1}\log n)^K are Hamiltonian when bipartite or γ\gamma-far from bipartite.

August 2026 counterexample claim

The preprint “Small circumference in regular sublinear expanders” reports a strong counterexample to the proposed universal Hamiltonicity statement, showing that the log-squared degree scale is a genuine obstruction. It is unrefereed, and the retrieved sources provide no independent verification.

Current status (as of August 2026): the universal claim is reported as refuted by an unrefereed preprint, while the counterexample remains unverified.

Sources

Solutions 0

No solutions have been posted yet.