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
- M. A. Grechkoseeva (ORCID: https://orcid.org/0000-0001-9908-6462)
- Nanying Yang (ORCID: https://orcid.org/0000-0001-9234-5820)
- Anatoly S. Kondrat'ev
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