Finite almost simple groups with prime graphs all of whose connected components are cliques

Аннотация

We find finite almost simple groups with prime graphs all of whose connected components are cliques, i.e., complete graphs. The proof is based on the following fact, which was obtained by the authors and is of independent interest: the prime graph of a finite simple nonabelian group contains two nonadjacent odd vertices that do not divide the order of the outer automorphism group of this group.