SearcharxivSearch

arXiv · 2609.07948

Co-intersection graphs of nonabelian finite simple groups have diameter two

Abstract

Let $G$ be a finite group. The co-intersection graph $\Delta_G ^c$ of $G$ has as its vertices the nontrivial proper subgroups of $G$, with edges joining those pairs of subgroups which intersect trivially. It is clear that every connected component of $\Delta_G ^c$ has diameter at most three. In this Note, we show that when $T$ is a nonabelian finite simple group, $\Delta_T$ is connected of diameter exactly two. We also make several observations about the extent to which a finite group is determined by its co-intersection graph, and about the class of finite graphs arising as co-intersection graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Henry Bradford, Kamilla Rekvényi. 2026-09-07. Co-intersection graphs of nonabelian finite simple groups have diameter two. https://arxiv.org/abs/2609.07948

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR