1 citations · 1 across the 6 of their papers we have counts for
1 paper · 2 filters
Peter J. Cameron
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 subjec…