For every integer d ≥ 2, the union of any d-regular graph on n vertices with a uniformly random 2-factor is Hamiltonian with high probability.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Hamilton cycles in regular graphs perturbed by a random 2-factor
For every integer d ≥ 2, the union of any d-regular graph on n vertices with a uniformly random 2-factor is Hamiltonian with high probability.