Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 149 / 4 / c

The Cayley graph ${\mathrm{Cay}}_S(G)$ is a connected graph with $|G|$ vertices. A shortest path never repeats a vertex, so it has at most $|G|-1$ edges. Therefore

Fix $\epsilon >0$ and set $d=2/\epsilon$. Suppose, towards a contradiction, thatwhere $\lambda$ will absorb constants depending only on $\epsilon$. Put $n=\lfloor |G{|}^{\epsilon }\rfloor$. Once $\lambda$ is large enough, $n\ge N(d)$, $n<D$, andPart (a) yields $H⊴C<G$ with $[G:C]=O_{\epsilon }(1)$, $H\subseteq S^{\lfloor n/2\rfloor }$, and $C/H$ nilpotent of class $O_{\epsilon }(1)$.

The subgroup core ${\bigcap }_{g\in G}gC{g}^{-1}$ is normal in $G$ and has index at most $[G:C]!$. Since $G$ is a simple group, the core is either $\{1\}$ or $G$. In the first case $|G|\le [G:C]!=O_{\epsilon }(1)$, which is excluded by increasing $\lambda$. Hence the core is $G$, so $C=G$.

Now $H⊴G$. Since $n/2<D$, the ball $S^{\lfloor n/2\rfloor }$ is not all of $G$, so $H\ne G$. Simplicity gives $H=\{1\}$, and therefore $G=C/H$ is a nilpotent group. A nontrivial finite nilpotent group has nontrivial center of a group; simplicity would force that center to be all of $G$, making $G$ Abelian. This contradicts the assumption that $G$ is non-abelian. Consequently