Solvable graphs and Fermat primes. (Q985049)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solvable graphs and Fermat primes. |
scientific article |
Statements
Solvable graphs and Fermat primes. (English)
0 references
20 July 2010
0 references
For a finite group \(G\) let \(\pi\) denote the set of prime divisors of the order of \(G\). The solvable graph of \(G\) is a graph with vertex set \(\pi\) and two distinct vertices \(p\) and \(q\) are joined by an edge iff there exists a solvable subgroup of \(G\) whose order is divisible by \(pq\). In the paper under review the author proves that a prime \(p\) is a Fermat prime iff \(p\) is joined to 2 in the solvable graph of any finite group whose order is divisible by \(2p\).
0 references
solvable subgroups
0 references
solvable graphs
0 references
Fermat primes
0 references
finite simple groups
0 references