The Random Graph

Peter J. Cameron ()
Additional contact information
Peter J. Cameron: School of Mathematics and Statistics, North Haugh

A chapter in The Mathematics of Paul Erdős II, 2013, pp 353-378 from Springer

Abstract: Summary Erdős and Rényi showed the paradoxical result that there is a unique (and highly symmetric) countably infinite random graph. This graph, and its automorphism group, form the subject of the present survey.

Keywords: Automorphism Group; Random Graph; Free Graph; Finite Graph; Span Subgraph (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7254-4_22

Ordering information: This item can be ordered from
http://www.springer.com/9781461472544

DOI: 10.1007/978-1-4614-7254-4_22

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().