On the diameter of intersection graphs of finite groups
Abstract
The intersection graph G of a finite group G is a simple graph with vertices the non-trivial proper subgroups of G, and an edge between two vertices if their corresponding subgroups intersect non-trivially. These graphs were introduced by Cs\'ak\'any and Poll\'ak in 1969. In this paper we answer two long-standing open questions posed by Cs\'ak\'any and Poll\'ak concerning the diameter of intersection graphs. We prove some necessary conditions for a non-simple group to have an intersection graph of diameter 4. We also construct the first examples of non-simple groups and alternating groups whose intersection graphs have diameter 4.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.