Finite almost simple groups with prime graphs all of whose connected components are cliques

被引：0

作者：

M. R. Zinov’eva

A. S. Kondrat’ev

机构：

[1] Ural Branch of the Russian Academy of Sciences,Krasovskii Institute of Mathematics and Mechanics

[2] Ural Federal University,undefined

来源：

Proceedings of the Steklov Institute of Mathematics | 2016年 / 295卷

关键词：

finite group; almost simple group; prime graph;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：178 / 188

页数：10