Characterization of groups E6(3) and 2E6(3) by Gruenberg--Kegel graph
Abstract
The Gruenberg--Kegel graph (or the prime graph) (G) of a finite group G is defined as follows. The vertex set of (G) is the set of all prime divisors of the order of G. Two distinct primes r and s regarded as vertices are adjacent in (G) if and only if there exists an element of order rs in G. Suppose that L E6(3) or L2E6(3). We prove that if G is a finite group such that (G)=(L), then G L.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.