Very Sparse Graphs

  • Joel Spencer
Part of the Algorithms and Combinatorics book series (AC, volume 22)


We hold to the view proposed in the original papers of Erdös and Rényi that the random graph G(n, p) evolves as p increases from empty to full. In its early stages — much like natural evolution — the behaviors are relatively simple to describe. For the random graph, early stages means up to p ͠ 1/n. As we are viewing the random graph through only a first order lens we shall actually go a bit further in this section. We summarize the results of Section 3.1 – 3.5 with Theorem 3.0.8.




Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Joel Spencer
    • 1
  1. 1.Courant InstituteNew York UniversityNew YorkUSA

Personalised recommendations