Abstract
We study two problems related to the existence of Hamilton cycles in random graphs. The first question relates to the number of edge disjoint Hamilton cycles that the random graph G n,p contains. δ(G)/2 is an upper bound and we show that if p ≤ (1 + o(1)) ln n/n then this upper bound is tight whp. The second question relates to how many edges can be adversarially removed from G n,p without destroying Hamiltonicity. We show that if p ≥ K ln n/n then there exists a constant α > 0 such that whp G − H is Hamiltonian for all choices of H as an n-vertex graph with maximum degree Δ(H) ≤ αK ln n.
Similar content being viewed by others
References
M. Ajtai, J. Komlós and E. Szemerédi, The first occurrence of Hamilton cycles in random graphs, Annals of Discrete Mathematics 27 (1985), 173–178.
T. Bohman, A. M. Frieze and R. Martin, How many random edges make a dense graph Hamiltonian?, Random Structures and Algorithms 22 (2003), 33–42.
B. Bollobás, The evolution of sparse graphs, in Graph Theory and Combinatorics, Proc. Cambridge Combinatorics Conference in Honour of Paul Erdős (B. Bollobás Ed.), Academic Press, London, 1984, pp. 35–57.
B. Bollobás, Random Graphs, 2nd Ed., Cambridge Univ. Press, Cambridge, 2001.
B. Bollobás and A. M. Frieze, On matchings and hamiltonian cycles in random graphs, Annals of Discrete Mathematics 28 (1985), 23–46.
T. I. Fenner and A. M. Frieze, On the existence of hamiltonian cycles in a class of random graphs, Discrete Mathematics 45 (1983), 301–305.
A. M. Frieze and M. Krivelevich, On packing Hamilton Cycles in ε-regular Graphs, Journal of Combinatorial Theory B 94 (2005), 159–172.
J. Komlós and E. Szemerédi, Limit distributions for the existence of Hamilton circuits in a random graph, Discrete Mathematics 43 (1983), 55–63.
L. Pósa, Hamiltonian circuits in random graphs, Discrete Mathematics 14 (1976), 359–364.
B. Sudakov and V. Vu, Resilience of graphs, Random Structures and Algorithms, to appear.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by NSF grant CCR-0200945.
Research supported in part by USA-Israel BSF Grant 2002-133 and by grant 526/05 from the Israel Science Foundation.
Rights and permissions
About this article
Cite this article
Frieze, A., Krivelevich, M. On two Hamilton cycle problems in random graphs. Isr. J. Math. 166, 221–234 (2008). https://doi.org/10.1007/s11856-008-1028-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-008-1028-8