Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs
Yahav Alon, Michael Krivelevich

TL;DR
This paper investigates the hitting time for the appearance of multiple edge-disjoint Hamilton cycles in random subgraphs of dense base graphs, establishing conditions under which this occurs simultaneously with minimum degree thresholds.
Contribution
It extends previous work by identifying new conditions on dense graphs that ensure the hitting time for multiple Hamilton cycles coincides with minimum degree thresholds.
Findings
Hitting time for k edge-disjoint Hamilton cycles matches minimum degree 2k in dense graphs.
Results apply to graphs with high minimum degree, bipartite expansion, and certain spectral properties.
Extends prior results and answers a question by Frieze.
Abstract
Consider the random subgraph process on a base graph on vertices: a sequence of random subgraphs of obtained by choosing an ordering of the edges of uniformly at random, and by sequentially adding edges to , the empty graph on the vertex set of , according to the chosen ordering. We show that if has one of the following properties: 1. There is a positive constant such that ; 2. There are some constants such that every two disjoint subsets of size at least have at least edges between them, and the minimum degree of is at least ; or: 3. is an --graph, with and $\lambda \leq \frac{c\cdot…
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.
Taxonomy
TopicsLimits and Structures in Graph Theory · Stochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods
