Erd\H{o}s and R\'{e}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.Comment: Revised chapter for new edition of book "The Mathematics of Paul
Erd\H{o}s
