Cores of random graphs are born Hamiltonian

Michael Krivelevich, Eyal Lubetzky, Benny Sudakov

Research output: Contribution to journalArticle

Abstract

Let (Gt) be the random graph process (G0) is edgeless and Gt is obtained by adding a uniformly distributed new edge to Gt-1), and let tk denote the minimum time t such that the k-core of Gt (its unique maximal subgraph with minimum degree at least k) is nonempty. For any fixed k ≥3, the k-core is known to emerge via a discontinuous phase transition, where at time t = tk its size jumps from 0 to linear in the number of vertices with high probability (w.h.p.). It is believed that for any k ≥3, the core is Hamiltonian upon creation w.h.p., and Bollob́as, Cooper, Fenner and Frieze further conjectured that it in fact admits ≥(k - 1)/2 edgedisjoint Hamilton cycles. However, even the asymptotic threshold for Hamiltonicity of the k-core in G(n, p) was unknown for any k. We show here that for any fixed k ≥15, the k-core of Gt is w.h.p. Hamiltonian for all t ≥tk, that is, immediately as the k-core appears and indefinitely afterwards. Moreover, we prove that for large enough fixed k the k-core contains ≥(k - 3)/2 edge-disjoint Hamilton cycles w.h.p. for all t ≥tk.

Original languageEnglish (US)
Pages (from-to)161-188
Number of pages28
JournalProceedings of the London Mathematical Society
Volume109
Issue number1
DOIs
StatePublished - 2014

Fingerprint

Random Graphs
Hamilton Cycle
Hamiltonicity
Minimum Degree
Immediately
Subgraph
Disjoint
Jump
Phase Transition
Denote
Unknown

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Cores of random graphs are born Hamiltonian. / Krivelevich, Michael; Lubetzky, Eyal; Sudakov, Benny.

In: Proceedings of the London Mathematical Society, Vol. 109, No. 1, 2014, p. 161-188.

Research output: Contribution to journalArticle

Krivelevich, Michael ; Lubetzky, Eyal ; Sudakov, Benny. / Cores of random graphs are born Hamiltonian. In: Proceedings of the London Mathematical Society. 2014 ; Vol. 109, No. 1. pp. 161-188.
@article{74804a3e53cd4922a2c2c7a02589b505,
title = "Cores of random graphs are born Hamiltonian",
abstract = "Let (Gt) be the random graph process (G0) is edgeless and Gt is obtained by adding a uniformly distributed new edge to Gt-1), and let tk denote the minimum time t such that the k-core of Gt (its unique maximal subgraph with minimum degree at least k) is nonempty. For any fixed k ≥3, the k-core is known to emerge via a discontinuous phase transition, where at time t = tk its size jumps from 0 to linear in the number of vertices with high probability (w.h.p.). It is believed that for any k ≥3, the core is Hamiltonian upon creation w.h.p., and Bollob́as, Cooper, Fenner and Frieze further conjectured that it in fact admits ≥(k - 1)/2 edgedisjoint Hamilton cycles. However, even the asymptotic threshold for Hamiltonicity of the k-core in G(n, p) was unknown for any k. We show here that for any fixed k ≥15, the k-core of Gt is w.h.p. Hamiltonian for all t ≥tk, that is, immediately as the k-core appears and indefinitely afterwards. Moreover, we prove that for large enough fixed k the k-core contains ≥(k - 3)/2 edge-disjoint Hamilton cycles w.h.p. for all t ≥tk.",
author = "Michael Krivelevich and Eyal Lubetzky and Benny Sudakov",
year = "2014",
doi = "10.1112/plms/pdu003",
language = "English (US)",
volume = "109",
pages = "161--188",
journal = "Proceedings of the London Mathematical Society",
issn = "0024-6115",
publisher = "Oxford University Press",
number = "1",

}

TY - JOUR

T1 - Cores of random graphs are born Hamiltonian

AU - Krivelevich, Michael

AU - Lubetzky, Eyal

AU - Sudakov, Benny

PY - 2014

Y1 - 2014

N2 - Let (Gt) be the random graph process (G0) is edgeless and Gt is obtained by adding a uniformly distributed new edge to Gt-1), and let tk denote the minimum time t such that the k-core of Gt (its unique maximal subgraph with minimum degree at least k) is nonempty. For any fixed k ≥3, the k-core is known to emerge via a discontinuous phase transition, where at time t = tk its size jumps from 0 to linear in the number of vertices with high probability (w.h.p.). It is believed that for any k ≥3, the core is Hamiltonian upon creation w.h.p., and Bollob́as, Cooper, Fenner and Frieze further conjectured that it in fact admits ≥(k - 1)/2 edgedisjoint Hamilton cycles. However, even the asymptotic threshold for Hamiltonicity of the k-core in G(n, p) was unknown for any k. We show here that for any fixed k ≥15, the k-core of Gt is w.h.p. Hamiltonian for all t ≥tk, that is, immediately as the k-core appears and indefinitely afterwards. Moreover, we prove that for large enough fixed k the k-core contains ≥(k - 3)/2 edge-disjoint Hamilton cycles w.h.p. for all t ≥tk.

AB - Let (Gt) be the random graph process (G0) is edgeless and Gt is obtained by adding a uniformly distributed new edge to Gt-1), and let tk denote the minimum time t such that the k-core of Gt (its unique maximal subgraph with minimum degree at least k) is nonempty. For any fixed k ≥3, the k-core is known to emerge via a discontinuous phase transition, where at time t = tk its size jumps from 0 to linear in the number of vertices with high probability (w.h.p.). It is believed that for any k ≥3, the core is Hamiltonian upon creation w.h.p., and Bollob́as, Cooper, Fenner and Frieze further conjectured that it in fact admits ≥(k - 1)/2 edgedisjoint Hamilton cycles. However, even the asymptotic threshold for Hamiltonicity of the k-core in G(n, p) was unknown for any k. We show here that for any fixed k ≥15, the k-core of Gt is w.h.p. Hamiltonian for all t ≥tk, that is, immediately as the k-core appears and indefinitely afterwards. Moreover, we prove that for large enough fixed k the k-core contains ≥(k - 3)/2 edge-disjoint Hamilton cycles w.h.p. for all t ≥tk.

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

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

U2 - 10.1112/plms/pdu003

DO - 10.1112/plms/pdu003

M3 - Article

AN - SCOPUS:84904337738

VL - 109

SP - 161

EP - 188

JO - Proceedings of the London Mathematical Society

JF - Proceedings of the London Mathematical Society

SN - 0024-6115

IS - 1

ER -