|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2015, Volume 21, Number 3, Pages 132–141
(Mi timm1206)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Finite almost simple groups with prime graphs all of whose connected components are cliques
M. R. Zinov'evaab, A. S. Kondrat'evba a Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg
b Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
Abstract:
We find finite almost simple groups with prime graphs all of whose connected components are cliques, i.e., complete graphs. The proof is based on the following fact, which was obtained by the authors and is of independent interest: the prime graph of a finite simple nonabelian group contains two nonadjacent odd vertices that do not divide the order of the outer automorphism group of this group.
Keywords:
finite group, almost simple group, prime graph.
Received: 20.06.2015
Citation:
M. R. Zinov'eva, A. S. Kondrat'ev, “Finite almost simple groups with prime graphs all of whose connected components are cliques”, Trudy Inst. Mat. i Mekh. UrO RAN, 21, no. 3, 2015, 132–141; Proc. Steklov Inst. Math. (Suppl.), 295, suppl. 1 (2016), 178–188
Linking options:
https://www.mathnet.ru/eng/timm1206 https://www.mathnet.ru/eng/timm/v21/i3/p132
|
Statistics & downloads: |
Abstract page: | 336 | Full-text PDF : | 92 | References: | 63 | First page: | 6 |
|