The random graph
Combinatorics
2013-02-01 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1301.7544,
title = {The random graph},
author = {Peter J. Cameron},
journal= {arXiv preprint arXiv:1301.7544},
year = {2013}
}
Comments
Revised chapter for new edition of book "The Mathematics of Paul Erd\H{o}s"