Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Spencer, J. (2001). Very Sparse Graphs. In: The Strange Logic of Random Graphs. Algorithms and Combinatorics, vol 22. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04538-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-04538-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07499-8
Online ISBN: 978-3-662-04538-1
eBook Packages: Springer Book Archive