Long paths in sparse random graphs


We consider random graphs withn labelled vertices in which edges are chosen independently and with probabilityc/n. We prove that almost every random graph of this kind contains a path of length ≧(1 −α(c))n where α(c) is an exponentially decreasing function ofc.

This is a preview of subscription content, access via your institution.


  1. [1]

    M. Ajtai, J. Komlós andE. Szemerédi, The longest path in a random graph,Combinatorica 1 (1981) 1–12.

    MATH  MathSciNet  Google Scholar 

  2. [2]

    B. Bollobás,Graph Theory — An Introductory Course, Graduate Texts in Mathematics, Springer-Verlag, New York, Heidelberg and Berlin, 1979.

    MATH  Google Scholar 

  3. [3]

    P. Erdős andA. Rényi, On the evolution of random graphs,Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960) 17–61.

    Google Scholar 

  4. [4]

    T. I. Fenner andA. M. Frieze, On the existence of hamiltonian cycles in a class of random graphs,to appear.

  5. [5]

    W. F. de la Véga, Long paths in random graphs,Combinatorica 3 (1983)

Download references

Author information



Additional information

Dedicated to Tibor Gallai on his seventieth birthday

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bollobás, B. Long paths in sparse random graphs. Combinatorica 2, 223–228 (1982). https://doi.org/10.1007/BF02579230

Download citation

AMS subject classification (1980)

  • 05 C 38
  • 60 C 05