How many random edges make a graph hamiltonian?

Eli Shamir*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

A threshold for a graph property Q in the scale of random graph spaces G n,p is a p-band across which the asymptotic probability of Q jumps from 0 to 1. We locate a sharp threshold for the property of having a hamiltonian path.

Original languageEnglish
Pages (from-to)123-131
Number of pages9
JournalCombinatorica
Volume3
Issue number1
DOIs
StatePublished - Mar 1983

Keywords

  • AMS subject classification (1980): 60C05

Fingerprint

Dive into the research topics of 'How many random edges make a graph hamiltonian?'. Together they form a unique fingerprint.

Cite this