On the asymmetry of random regular graphs and random graphs
Jeong Han Kim, Benny Sudakov, Van H. Vu
Abstract
Jeong Han Kim, Benny Sudakov, Van H. Vu
Abstract
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
OpenAlex reports 80 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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
Key concepts: Random regular graph, Random graph, struct, Mathematics, Combinatorics, Automorphism, Discrete mathematics, Indifference graph