Abstract
This paper studies the symmetry of random regular graphs and random graphs. Our main result shows that for all 3 ≤ d ≤ n − 4 the random d‐regular graph on n vertices almost surely has no nontrivial automorphisms. This answers an open question of N. Wormald [13]. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 216–224, 2002

This publication has 11 references indexed in Scilit: