Randomly perturbing a graph with O(n) random edges forces a colour-biased Hamilton cycle, and at the critical minimum degree the bias is proportional to m.
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
REJECT 1representative citing papers
citing papers explorer
-
Colour-biased Hamilton cycles in randomly perturbed graphs
Randomly perturbing a graph with O(n) random edges forces a colour-biased Hamilton cycle, and at the critical minimum degree the bias is proportional to m.