Cores of random graphs are born Hamiltonian

DOI10.1112/PLMS/PDU003zbMath1301.05205arXiv1303.3524OpenAlexW2057897835MaRDI QIDQ2874667

Eyal Lubetzky, Michael Krivelevich, Benjamin Sudakov

Publication date: 8 August 2014

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.3524

zbMATH Keywords

Hamiltonicityrandom graph process\(k\)-core

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Singularity of the \(k\)-core of a random graph ⋮ Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis ⋮ Spanning trees in random graphs ⋮ Hamiltonicity in random graphs is born resilient

Cites Work

• Unnamed Item
• Encores on cores
• Asymptotic normality of the \(k\)-core in random graphs
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Size and connectivity of the \(k\)-core of a random graph
• Hamiltonian circuits in random graphs
• Sudden emergence of a giant \(k\)-core in a random graph
• On the threshold for \(k\)-regular subgraphs of random graphs
• On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three
• Hamiltonicity thresholds in Achlioptas processes
• (k+1)-Cores Have k-Factors
• Almost all graphs with 1.44n edges are 3-colorable
• Probability Inequalities for the Sum of Independent Random Variables
• A simple solution to the k‐core problem
• Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk
• Cores in random hypergraphs and Boolean formulas
• Probability Inequalities for Sums of Bounded Random Variables
• Thek-Core and Branching Processes
• The Factorization of Linear Graphs

This page was built for publication: Cores of random graphs are born Hamiltonian