How many random edges make a graph hamiltonian?

Eli Shamir

doi:10.1007/BF02579348

How many random edges make a graph hamiltonian?

Eli Shamir^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	123-131
Number of pages	9
Journal	Combinatorica
Volume	3
Issue number	1
DOIs	https://doi.org/10.1007/BF02579348
State	Published - Mar 1983

Keywords

AMS subject classification (1980): 60C05

Access to Document

10.1007/BF02579348

Cite this

@article{a4e00b11503843f99bc2b6041dfc33eb,

title = "How many random edges make a graph hamiltonian?",

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.",

keywords = "AMS subject classification (1980): 60C05",

author = "Eli Shamir",

year = "1983",

month = mar,

doi = "10.1007/BF02579348",

language = "אנגלית",

volume = "3",

pages = "123--131",

journal = "Combinatorica",

issn = "0209-9683",