Hamilton cycles in regular graphs perturbed by a random 2-factor
Abstract
In this paper, we prove that for each d ≥ 2, the union of a d-regular graph with a uniformly random 2-factor on the same vertex set is Hamiltonian with high probability. This resolves a conjecture by Dragani\'c and Keevash for all values of d.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.