The global resilience of Hamiltonicity in \(G(n, p)\)

DOI10.1007/s00373-023-02701-4zbMath1526.05122arXiv2206.15235OpenAlexW4386073617MaRDI QIDQ6063284

Yahav Alon

Publication date: 7 November 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsHamilton cycles

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Arc coverings of graphs
• Hamiltonian circuits in random graphs
• Random graph's Hamiltonicity is strongly tied to its minimum degree
• Hamiltonicity in random graphs is born resilient
• A note on Hamiltonian circuits
• Introduction to Random Graphs
• Dirac's theorem for random graphs
• On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
• Local resilience of graphs
• Resilience of perfect matchings and Hamiltonicity in random graph processes
• Robustness of graph properties
• On the existence of a factor of degree one of a connected random graph

This page was built for publication: The global resilience of Hamiltonicity in \(G(n, p)\)