Abstract
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.
Cite
CITATION STYLE
APA
Cameron, P. J. (2013). The random graph. In The Mathematics of Paul Erdos II, Second Edition (pp. 353–378). Springer New York. https://doi.org/10.1007/978-1-4614-7254-4_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free