Metraipolis › archive › dc_b0eea717bf65

Every $r$-regular Hamiltonian graph with $r\geq 17$ contains a second Hamilton cycle — arXiv:2611.06985

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06985
License (as archived)
CC0-1.0
Archived
2026-11-06T14:52:37.190Z
SHA-256 of the archived text
921602b3fe60ad8c283b958504c61ebc33a1e737d0bc4cd1fc19667bc261664d
Stable URL of this page
https://metraipolis.com/documento/dc_b0eea717bf65

How to cite

Every $r$-regular Hamiltonian graph with $r\geq 17$ contains a second Hamilton cycle — arXiv:2611.06985 — arXiv (en), https://arxiv.org/abs/2611.06985 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b0eea717bf65 (Metraipolis archive dc_b0eea717bf65, sha256 921602b3fe60ad8c283b958504c61ebc33a1e737d0bc4cd1fc19667bc261664d)
BibTeX
@misc{dcb0eea717bf65,
  title = {Every $r$-regular Hamiltonian graph with $rgeq 17$ contains a second Hamilton cycle — arXiv:2611.06985},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06985},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b0eea717bf65; sha256 921602b3fe60ad8c283b958504c61ebc33a1e737d0bc4cd1fc19667bc261664d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06985. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A conjecture of Sheehan states that every Hamiltonian $4$-regular graph contains a second Hamilton cycle. A natural problem is to find the smallest positive integer $k$ such that every Hamiltonian $r$-regular graph contains a second Hamilton cycle when $r\geq k$. Thomassen proved that $k\leq 300$. Improving Thomassen's result, Haxell, Seamone, and Verstra{ë}te proved that $k\leq 23$. We improve this bound by proving that every $r$-regular Hamiltonian graph contains a second Hamilton cycle whenever $r\geq 17$. Our new idea is to establish a transversal theorem for set systems on a cycle using Harris's results on the Moser--Tardos algorithm for Local Lemma. We then apply Thomassen's theorem on independent dominating sets to obtain a second Hamilton cycle. For $r\ge 18$, we also give some algorithms to find such a transversal.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.06985 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:24:27.836Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).