Random graph’s hamiltonicity is strongly tied to its minimum degree

Research output: Contribution to journalArticlepeer-review

Abstract

We show that the probability that a random graph G ∼ G(n, p) contains no Hamilton cycle is (1 + o(1))P r(δ(G) < 2) for all values of p = p(n). We also prove an analogous result for perfect matchings.

Original languageEnglish
Article numberP1.30
JournalElectronic Journal of Combinatorics
Volume27
Issue number1
DOIs
StatePublished - 2020

Fingerprint

Dive into the research topics of 'Random graph’s hamiltonicity is strongly tied to its minimum degree'. Together they form a unique fingerprint.

Cite this