Cocliques of maximal size in the prime graph of a finite simple group (Q695782): Difference between revisions

The prime graph of a finite group has the vertex set consisting of the prime divisors of the group order. Two distinct vertices \(r\) and \(s\) are joined by an edge if there exists an element of order \(rs\) in the group. The authors desribe all cocliques of maximal size for finite simple groups, in form of tables for simple linear, unitary, simplectic, orthogonal and exceptional groups. In an appendix the authors give a list of corrections for an earlier paper of theirs: [Algebra Logika 44, No. 6, 682--725 (2005); translation in Algebra Logic 44, No. 6, 381--406 (2005; Zbl 1104.20018)].