Abstract
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, log in via an institution to check access.
Similar content being viewed by others
References
M. Ajtai, J. Komlós andE. Szemerédi, The longest path in a random graph,Combinatorica 1 (1981) 1–12.
B. Bollobás,Graph Theory — An Introductory Course, Graduate Texts in Mathematics, Springer-Verlag, New York, Heidelberg and Berlin, 1979.
P. Erdős andA. Rényi, On the evolution of random graphs,Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960) 17–61.
T. I. Fenner andA. M. Frieze, On the existence of hamiltonian cycles in a class of random graphs,to appear.
W. F. de la Véga, Long paths in random graphs,Combinatorica 3 (1983)
Author information
Authors and Affiliations
Additional information
Dedicated to Tibor Gallai on his seventieth birthday