Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs

DOI10.1137/20M1375838zbMath1486.05167arXiv1912.01251OpenAlexW2994191279MaRDI QIDQ5067425

Michael Krivelevich, Yahav Alon

Publication date: 1 April 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random graphHamilton cyclegraph process

Mathematics Subject Classification ID

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

Related Items (1)

Spectrum of Johnson graphs

Cites Work

• On two Hamilton cycle problems in random graphs
• Explicit construction of linear sized tolerant networks
• Hamiltonian circuits in random graphs
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs
• Hamilton cycles in random subgraphs of pseudo-random graphs
• Hamiltonicity in random graphs is born resilient
• On randomk-out subgraphs of large graphs
• Approximate Hamilton decompositions of random graphs
• Pattern Colored Hamilton Cycles in Random Graphs
• Packing Hamilton Cycles Online
• On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
• Optimal Packings of Hamilton Cycles in Sparse Random Graphs
• On Hamilton cycles in Erdős‐Rényi subgraphs of large graphs
• Edge-disjoint Hamilton cycles in random graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Robust Hamiltonicity of Dirac graphs
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs