$K_{3,3}$-free Intersection Graphs of Finite Groups

Abstract

The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$ and $K$ if and only if $H\cap K\ne 1$ where $1$ denotes the trivial subgroup of $G$. In this paper we classify all finite groups whose intersection graphs are $K_{3,3}$-free.

arXiv commentProof of Proposition 10 is due to the anonymous referee