Title

Long paths in sparse random graphs

Abstract

We consider random graphs with n labelled vertices in which edges are chosen independently and with probability c/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 of c. © 1982 Akadémiai Kiadó.

Publication Title

Combinatorica

Share

COinS