Cocliques of maximal size in the prime graph of a finite simple group

By Andrey Vasil'ev, E. Vdovin. 2009

111 citations recorded by the source corpus.

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.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/19d821a901e80e28f9e45d2a820b10eb82bbf188

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Andrey Vasil'ev
2. V. Mazurov
3. M. A. Grechkoseeva

Citations in the corpus

• Characterization of the finite simple groups by spectrum and order (2009, background): “2(2) and the information on cocliques of prime graphs of finite simple groups from [29, 34].”