For a finite group with a symmetric generating set , its diameter isEquivalently, it is the diameter of the Cayley graph .
A connected Cayley graph on a finite group has vertices, and a shortest path repeats no vertex. Therefore
For every there is such that every non-abelian finite simple group and every finite symmetric generating set containing the identity satisfyThe proof applies the one-scale virtual nilpotence theorem below the diameter and then uses simplicity to eliminate both the bounded-index subgroup and the finite normal subgroup.
Articles by others on the same topic
There are currently no matching articles.