English

Hamilton cycles in regular graphs perturbed by a random 2-factor

Combinatorics 2025-08-26 v2

Abstract

In this paper, we prove that for each d2d \geq 2, the union of a dd-regular graph with a uniformly random 22-factor on the same vertex set is Hamiltonian with high probability. This resolves a conjecture by Dragani\'c and Keevash for all values of dd.

Keywords

Cite

@article{arxiv.2506.21756,
  title  = {Hamilton cycles in regular graphs perturbed by a random 2-factor},
  author = {Cicely and Henderson and Sean Longbrake and Dingjia Mao and Patryk Morawski},
  journal= {arXiv preprint arXiv:2506.21756},
  year   = {2025}
}

Comments

17 pages, complete the case of $d=2$

R2 v1 2026-07-01T03:35:27.309Z