Prime graph components of finite almost simple groups (Q1962576)

The prime graph \(\Gamma(G)\) of a finite group \(G\) is constructed as follows: its vertices are the primes dividing the order of \(G\) and vertices \(p\), \(q\) are joined by an edge if there is an element of \(G\) of order \(pq\). The general structure of a finite group with non-connected prime graph has been determined by K. W. Gruenberg and O. Kegel in an unpublished manuscript. The finite simple groups with non-connected prime graph have been described by \textit{J. S. Williams} [J. Algebra 69, 487-513 (1981; Zbl 0471.20013)], the reviewer [Mat. Sb. 180, No. 6, 787-797 (1989; Zbl 0691.20013)], and \textit{N. Iiyori} and \textit{H. Yamaki} [J. Algebra 155, No. 2, 335-343 (1993; Zbl 0799.20016)]. In this paper the author describes the prime graph components of the almost simple but non-simple groups with non-connected prime graph. A group \(G\) is almost simple if its socle \(S\) is a finite simple non-Abelian group. First she observes that if \(\Gamma(G)\) is not connected then also \(\Gamma(S)\) is not connected. Then, using the classification of finite simple groups and the above mentioned results of Williams and the reviewer, she considers the various cases for \(G\). In particular, almost simple groups which are not simple have at most 4 components. Reviewer's remark: The tables of prime graph components in the above mentioned papers of Williams, the reviewer, and Iiyori and Yamaki contain some inaccuracies. In a recent paper of the reviewer and \textit{V. D. Mazurov} [Sib. Mat. Zh. 41, No. 2, 360-371 (2000)] the corresponding tables are given in correct form. The results of the paper under review require corresponding corrections.