In G(n,p) with n odd, the threshold p=(log n+2 log log n+ω(1))/n is both necessary and sufficient for Hamilton cycles to span the whole cycle space.
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
-
The Hamilton cycle space of random graphs
In G(n,p) with n odd, the threshold p=(log n+2 log log n+ω(1))/n is both necessary and sufficient for Hamilton cycles to span the whole cycle space.