# zbMATH — the first resource for mathematics

The random graph. 1st ed. (English) Zbl 0864.05076
Graham, Ronald L. (ed.) et al., The mathematics of Paul Erdős. Vol. II. Berlin: Springer. Algorithms Comb. 14, 333-351 (1997).
In 1963 Erdös and Renyi showed that there is a unique countably infinite random graph. As the author of this paper observes, we have here a random process whose outcome is predictable! This paper surveys what is known about this graph as well its automorphism group.
For the entire collection see [Zbl 0855.00014].

##### MSC:
 05C80 Random graphs (graph-theoretic aspects) 05C25 Graphs and abstract algebra (groups, rings, fields, etc.) 03C35 Categoricity and completeness of theories
##### Keywords:
random graph; automorphism group