On groups having the prime graph as alternating and symmetric groups
Abstract
The prime graph (G) of a finite group G is the graph whose vertex set is the set of prime divisors of |G| and in which two distinct vertices r and s are adjacent if and only if there exists an element of G of order rs. Let An (Sn) denote the alternating (symmetric) group of degree n. We prove that if G is a finite group with (G)=(An) or (G)=(Sn), where n≥19, then there exists a normal subgroup K of G and an integer t such that At≤ G/K≤ St and |K| is divisible by at most one prime greater than n/2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.