Skip to main content

2001 | OriginalPaper | Buchkapitel

Very Sparse Graphs

verfasst von : Joel Spencer

Erschienen in: The Strange Logic of Random Graphs

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Metadaten
Titel
Very Sparse Graphs
verfasst von
Joel Spencer
Copyright-Jahr
2001
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-662-04538-1_4