Hamiltonicity of random graphs produced by 2‐processes

DOI10.1002/rsa.20133zbMath1129.05026OpenAlexW4232597137MaRDI QIDQ5433272

Sanming Zhou, Andras Telcs, Nicholas C. Wormald

Publication date: 8 January 2008

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20133

zbMATH Keywords

graphprobabilitydifferential equationmartingaleHamiltonicityHamilton cyclerandom graph processlarge deviation inequality2-process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

SIR epidemics on random graphs with a fixed degree sequence ⋮ The sharp threshold for making squares ⋮ A gentle introduction to the differential equation method and dynamic concentration ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ A natural barrier in random greedy hypergraph matching ⋮ A note on the random greedy independent set algorithm

Cites Work

• Random Graph Processes with Degree Restrictions
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonicity of random graphs produced by 2‐processes