The random graph
arXiv:1301.7544
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.
Revised chapter for new edition of book "The Mathematics of Paul Erdős"