"Long paths in sparse random graphs" by Béla Bollobás
 

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

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 21
  • Usage
    • Abstract Views: 3
  • Captures
    • Readers: 2
see details

Share

COinS