On primes not adjacent to $2$ in the prime graphs of almost simple groups

The prime graph $GK(G)$ of a finite group $G$ is the graph whose vertices are primes dividing the order of $G$ and in which two distinct primes $r$ and $s$ are adjacent if and only if $G$ has an element of order $rs$. The $2$-independence number of $GK(G)$ is the maximal size of independent vertex subsets in $GK(G)$ containing the vertex~$2$. We determine all almost simple groups whose prime graph has a vertex $r$ not adjacent to $2$ and find the $2$-independence numbers of all almost simple groups.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.23766
Primary Topic
Finite Group Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

On primes not adjacent to $2$ in the prime graphs of almost simple groups

M. A. Grechkoseeva, Nanying Yang, Anatoly S. Kondrat'ev
arXiv (Cornell University)
Finite Group Theory Research
preprint

On primes not adjacent to $2$ in the prime graphs of almost simple groups

M. A. Grechkoseeva, Nanying Yang, Anatoly S. Kondrat'ev
preprint en

Abstract

The prime graph $GK(G)$ of a finite group $G$ is the graph whose vertices are primes dividing the order of $G$ and in which two distinct primes $r$ and $s$ are adjacent if and only if $G$ has an element of order $rs$. The $2$-independence number of $GK(G)$ is the maximal size of independent vertex subsets in $GK(G)$ containing the vertex~$2$. We determine all almost simple groups whose prime graph has a vertex $r$ not adjacent to $2$ and find the $2$-independence numbers of all almost simple groups.

arXiv (Cornell University)
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon