First Occurrence of Hamilton Cycles in Random Graphs

M. Ajtai, J. Komlós, E. Szemerédi

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

Let us produce a random graph on n vertices by selecting edges one at a time at random and stopping at the first moment that the minimum degree achieves 2. Then with probability 1-0(1), the resulting graph is hamiltonian.

Original languageEnglish
Pages (from-to)173-178
Number of pages6
JournalNorth-Holland Mathematics Studies
Volume115
Issue numberC
DOIs
Publication statusPublished - 1985

Fingerprint

Hamilton Cycle
Minimum Degree
Random Graphs
Moment
Graph in graph theory

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

First Occurrence of Hamilton Cycles in Random Graphs. / Ajtai, M.; Komlós, J.; Szemerédi, E.

In: North-Holland Mathematics Studies, Vol. 115, No. C, 1985, p. 173-178.

Research output: Contribution to journalArticle

Ajtai, M. ; Komlós, J. ; Szemerédi, E. / First Occurrence of Hamilton Cycles in Random Graphs. In: North-Holland Mathematics Studies. 1985 ; Vol. 115, No. C. pp. 173-178.
@article{e7ceb07d9e9543af959e6dc0bbbfef1e,
title = "First Occurrence of Hamilton Cycles in Random Graphs",
abstract = "Let us produce a random graph on n vertices by selecting edges one at a time at random and stopping at the first moment that the minimum degree achieves 2. Then with probability 1-0(1), the resulting graph is hamiltonian.",
author = "M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di",
year = "1985",
doi = "10.1016/S0304-0208(08)73007-X",
language = "English",
volume = "115",
pages = "173--178",
journal = "North-Holland Mathematics Studies",
issn = "0304-0208",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - First Occurrence of Hamilton Cycles in Random Graphs

AU - Ajtai, M.

AU - Komlós, J.

AU - Szemerédi, E.

PY - 1985

Y1 - 1985

N2 - Let us produce a random graph on n vertices by selecting edges one at a time at random and stopping at the first moment that the minimum degree achieves 2. Then with probability 1-0(1), the resulting graph is hamiltonian.

AB - Let us produce a random graph on n vertices by selecting edges one at a time at random and stopping at the first moment that the minimum degree achieves 2. Then with probability 1-0(1), the resulting graph is hamiltonian.

UR - http://www.scopus.com/inward/record.url?scp=0242368930&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242368930&partnerID=8YFLogxK

U2 - 10.1016/S0304-0208(08)73007-X

DO - 10.1016/S0304-0208(08)73007-X

M3 - Article

AN - SCOPUS:0242368930

VL - 115

SP - 173

EP - 178

JO - North-Holland Mathematics Studies

JF - North-Holland Mathematics Studies

SN - 0304-0208

IS - C

ER -