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

Yahav Alon; Michael Krivelevich

doi:10.37236/8339

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

Yahav Alon, Michael Krivelevich

Tel Aviv University

Research output: Contribution to journal › Article › peer-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 language	English
Article number	P1.30
Journal	Electronic Journal of Combinatorics
Volume	27
Issue number	1
DOIs	https://doi.org/10.37236/8339
State	Published - 2020

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/8339

Cite this

@article{31e75fd9dab64056ab1256fcf7dc1df5,

title = "Random graph{\textquoteright}s hamiltonicity is strongly tied to its minimum degree",

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

author = "Yahav Alon and Michael Krivelevich",

note = "Publisher Copyright: {\textcopyright} The authors.",

year = "2020",

doi = "10.37236/8339",

language = "الإنجليزيّة",

volume = "27",

journal = "Electronic Journal of Combinatorics",

issn = "0022-5282",

publisher = "Electronic Journal of Combinatorics",

number = "1",

}

TY - JOUR

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

AU - Alon, Yahav

AU - Krivelevich, Michael

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

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

U2 - 10.37236/8339

DO - 10.37236/8339

M3 - مقالة

SN - 0022-5282

VL - 27

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1

M1 - P1.30

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this