|
This article is cited in 76 scientific papers (total in 76 papers)
Cocliques of maximal size in the prime graph of a finite simple group
A. V. Vasil'evab, E. P. Vdovinab a Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
A prime graph of a finite group is defined in the following way: the set of vertices of the graph is the set of prime divisors of the order of the group, and two distinct vertices $r$ and $s$ are joined by an edge if there is an element of order $rs$ in the group. We describe all cocliques of maximal size for finite simple groups.
Keywords:
finite simple group, group of Lie type, prime graph, coclique.
Received: 01.10.2010 Revised: 17.03.2011
Citation:
A. V. Vasil'ev, E. P. Vdovin, “Cocliques of maximal size in the prime graph of a finite simple group”, Algebra Logika, 50:4 (2011), 425–470; Algebra and Logic, 50:4 (2011), 291–322
Linking options:
https://www.mathnet.ru/eng/al495 https://www.mathnet.ru/eng/al/v50/i4/p425
|
Statistics & downloads: |
Abstract page: | 1146 | Full-text PDF : | 363 | References: | 86 | First page: | 17 |
|