5-cycles in the complement of minimal prime graphs

Minimal prime graphs (MPGs) are a special class of prime graphs (also known as Gruenberg-Kegel graphs) associated with finite solvable groups. A graph is an MPG if it has at least two vertices, is connected, its complement is triangle-free and 3-colorable, and the addition of an edge to the complement will violate triangle-freeness or 3-colorability. In this paper, we continue the study of the complements of MPGs focusing on their cycle structure. Our main result establishes that every edge in the complement of an MPG is contained in a 5-cycle. This finding is a much stronger form of an older result stating that every minimal prime graph complement contains at least one induced 5-cycle.

💡 Research Summary

The paper investigates a special subclass of prime graphs—minimal prime graphs (MPGs)—which arise from the study of finite solvable groups. An MPG is defined as a connected graph with at least two vertices whose complement is triangle‑free, 3‑colorable, and maximal with respect to these properties (adding any edge to the complement destroys triangle‑freeness or 3‑colorability). The complement of an MPG is denoted MPGC.

Previous work (Gruber, Keller, Lewis, Naughton, Strasser 2015) showed that a graph is the prime graph of a finite solvable group iff its complement is triangle‑free and 3‑colorable. From this, it follows that MPGCs are connected, have minimum degree at least two, and have diameter 2 or 3. Earlier results also established that every MPGC contains at least one induced 5‑cycle.

The main contribution of the present article is a dramatic strengthening of that statement: every edge of an MPGC lies on a 5‑cycle. In other words, the edge‑wise 5‑cycle property holds for the entire class of MPGCs.

To prove this, the authors first analyze a 7‑cycle that appears as a subgraph of an MPGC. By fixing a proper 3‑coloring and examining the possible placements of the three colors, they show that any edge of the 7‑cycle can be extended to a 5‑cycle using the concept of a “blocking vertex” (a vertex that prevents the addition of a forbidden edge). This lemma (Lemma 4.1) serves as the basic building block.

The central technical device is a parametrized family of graphs denoted Γ(m,n,k,l,x,y). The vertex set is partitioned into six disjoint subsets (red, blue, green) with prescribed adjacency rules. Lemma 4.3 proves that each Γ‑graph is bipartite. Lemma 4.4 treats the case k = 0 and shows that either a new vertex can be added to obtain Γ(m,n,1,l,x,y) or every existing edge already belongs to a 5‑cycle. Lemma 4.5 (and the subsequent inductive argument) iterates this process: whenever a Γ‑subgraph appears inside an MPGC, either the subgraph is already “5‑cycle‑saturated” or it can be enlarged by introducing a blocking vertex, thereby increasing the parameter k by one. Repeating this enlargement eventually forces every edge of the MPGC to be covered by a 5‑cycle, because the maximality condition of MPGCs prevents an infinite chain of extensions.

The paper also situates MPGCs within a broader family of triangle‑free graphs where every edge belongs to a 5‑cycle. This family includes the Petersen graph and its generalizations P(n,2), both of which are known MPGCs. While a full classification of the family remains out of reach, the additional constraints inherent to MPGCs (minimum degree ≥ 2, diameter ≤ 3, specific blocking‑vertex structure) suggest that a complete description might be attainable in future work.

In conclusion, the authors have proved that the edge‑wise 5‑cycle property holds for all minimal prime graph complements, thereby strengthening earlier existence results and providing a new structural insight into the interplay between group‑theoretic properties (Frobenius actions, Sylow subgroup configurations) and graph‑theoretic constraints. This result not only deepens our understanding of MPGs themselves but also contributes to the broader study of triangle‑free, 3‑colorable graphs, opening avenues for further classification and applications in finite group theory.