Cocliques of maximal size in the prime graph of a finite simple group (Q695782)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6116196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cocliques of maximal size in the prime graph of a finite simple group |
scientific article; zbMATH DE number 6116196 |
Statements
Cocliques of maximal size in the prime graph of a finite simple group (English)
0 references
17 December 2012
0 references
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)].
0 references
finite simple group
0 references
group of Lie type
0 references
prime graph
0 references
coclique
0 references
0.838297963142395
0 references
0.7994703650474548
0 references
0.7974472641944885
0 references
0.7957086563110352
0 references