The automorphism group of the random graph: four conjugates good, three conjugates better Original Research Article

In Math. Proc. Cambridge Philos. Soc. 98 (1985) 213 it was shown that the automorphism group of the random graph is simple, and that ‘five conjugates’ suffice to demonstrate this. Rubin (Handwritten notes on simple automorphism groups, 1988) improved this number to four, and here I show that three suffice. This number is optimal.