Hamiltonicity in random graphs is born resilient
Richard Montgomery

TL;DR
This paper proves that in the random graph process, graphs with minimum degree at least 2 are almost surely resiliently Hamiltonian up to a certain threshold, strengthening previous results on Hamiltonicity resilience.
Contribution
It establishes the almost sure resilience thresholds for Hamiltonicity in the random graph process, extending prior work by Lee, Sudakov, and others on the resilience of Hamiltonian properties.
Findings
Graphs with minimum degree ≥ 2 are (1/2−ε)-resiliently Hamiltonian.
Graphs are not (1/2+ε)-resiliently Hamiltonian almost surely.
Every non-empty k-core with large enough k is (1/2−ε)-resiliently Hamiltonian.
Abstract
Let be the random graph process, where is the empty graph on vertices and subsequent graphs in the sequence are obtained by adding a new edge uniformly at random. For each , we show that, almost surely, any graph with minimum degree at least 2 is not only Hamiltonian (as shown by Bollob\'as), but remains Hamiltonian despite the removal of any set of edges, as long as at most of the edges incident to each vertex are removed. We say that such a graph is -resiliently Hamiltonian. Furthermore, for each , we show that, almost surely, each graph is not -resiliently Hamiltonian. These results strengthen those by Lee and Sudakov on the likely resilience of Hamiltonicity in the binomial random graph. For each , we denote by the (possibly empty) maximal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
