Skip to main content
×
×
Home

The Threshold Probability for Long Cycles

  • ROMAN GLEBOV (a1), HUMBERTO NAVES (a2) and BENNY SUDAKOV (a3)
Abstract

For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G obtained by retaining each edge independently with probability p = p(k). We prove that if p ⩾ (logk + loglogk + ωk (1))/k, where ωk (1) is any function tending to infinity with k, then Gp asymptotically almost surely contains a cycle of length at least k + 1. When we take G to be the complete graph on k + 1 vertices, our theorem coincides with the classic result on the threshold probability for the existence of a Hamilton cycle in the binomial random graph.

Copyright
References
Hide All
[1] Alon, N. and Spencer, J. (2008) The Probabilistic Method, Wiley.
[2] Ben-Shimon, S., Krivelevich, M. and Sudakov, B. (2011) On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs. SIAM J. Discrete Math. 25 11761193.
[3] Bollobás, B. (1984) The evolution of sparse graphs. In Graph Theory and Combinatorics: Proc. Cambridge Combinatorial Conference in honor of Paul Erdős, Academic Press, pp. 3557.
[4] Bollobás, B. (2001) Random Graphs, second edition, Cambridge University Press.
[5] Diestel, R. (2010) Graph Theory, fourth edition, Vol. 173 of Graduate Texts in Mathematics, Springer.
[6] Erdős, P. and Rényi, A. (1960) On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5 1761.
[7] Gilbert, E. (1959) Random graphs. Ann. Math. Statist. 30 11411144.
[8] Glebov, R. and Krivelevich, M. (2013) On the number of Hamilton cycles in sparse random graphs. SIAM J. Discrete Math. 27 2742.
[9] Hopcroft, J. and Tarjan, R. (1973) Algorithm 447: Efficient algorithms for graph manipulation. Comm. Assoc. Comput. Mach. 16 372378.
[10] Komlós, J. and Szemerédi, E. (1983) Limit distributions for the existence of Hamilton circuits in a random graph. Discrete Math. 43 5563.
[11] Korshunov, A. (1976) Solution of a problem of Erdős and Rényi on Hamiltonian cycles in non-oriented graphs. Soviet Math. Dokl. 17 760764.
[12] Krivelevich, M., Lee, C. and Sudakov, B. (2015) Long paths and cycles in random subgraphs of graphs with large minimum degree. Random Struct. Alg. 46 320345.
[13] Krivelevich, M. and Sudakov, B. (2013) The phase transition in random graphs: A simple proof. Random Struct. Alg. 43 131138.
[14] Menger, K. (1927) Zur allgemeinen Kurventheorie. Fund. Math. 10 96115.
[15] Pósa, L. (1976) Hamiltonian circuits in random graphs. Discrete Math. 14 359364.
[16] Riordan, O. (2014) Long cycles in random subgraphs of graphs with large minimum degree. Random Struct. Alg. 45 764767.
[17] West, D. (2007) Introduction to Graph Theory, Prentice Hall.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 44 *
Loading metrics...

Abstract views

Total abstract views: 237 *
Loading metrics...

* Views captured on Cambridge Core between 8th September 2016 - 19th July 2018. This data will be updated every 24 hours.