Optimal packings of Hamilton cycles in sparse random graphs

Research output: Contribution to journalArticlepeer-review

Abstract

We prove that there exists a positive constant ε such that if log n/n ≤ p ≤ n -1+ε, then asymptotically almost surely the random graph G ∼ G(n, p) contains a collection of ⌊δ(G)/2⌋ edge-disjoint Hamilton cycles.

Original languageEnglish
Pages (from-to)964-982
Number of pages19
JournalSIAM Journal on Discrete Mathematics
Volume26
Issue number3
DOIs
StatePublished - 2012

Keywords

  • Hamilton cycle
  • Packing
  • Random graph

Fingerprint

Dive into the research topics of 'Optimal packings of Hamilton cycles in sparse random graphs'. Together they form a unique fingerprint.

Cite this