Minimal Prime Graphs (MPGs)

Updated 8 February 2026

Minimal Prime Graphs (MPGs) are defined as connected prime graphs whose complement is triangle-free and 3-colorable, ensuring edge-maximality for finite solvable groups.
Their structure is characterized by induced 5-cycles, vertex duplication from C₅, and alternative constructions such as clique generation and circulant methods.
MPGs provide deep insights into finite group theory by encoding maximal Frobenius actions among Hall subgroups, linking combinatorial properties with algebraic constraints.

Minimal Prime Graphs (MPGs) are a central concept at the intersection of finite group theory, graph theory, and combinatorics. Originating in the study of element orders in finite groups, particularly solvable groups, MPGs encode maximal configurations of Frobenius action among Hall subgroups in a purely combinatorial structure. Their definition, structural properties, and group-theoretic implications rely on deep interplay between the theory of triangle-free 3-colorable graphs, modern graph decompositions, spectral invariants, and classification problems for hereditary graph classes.

1. Definition and Characterization of Minimal Prime Graphs

Let $G$ be a finite group, and write $\pi(G)$ for the set of prime divisors of $|G|$ . The prime graph (also known as the Gruenberg–Kegel graph) $\Gamma(G)$ has vertex set $\pi(G)$ , with an edge between distinct primes $p,q$ if and only if $G$ contains an element of order $pq$ . This is equivalent to the Hall $\{p,q\}$ -subgroup of $G$ not being a direct product of its Sylow subgroups.

A graph $\Gamma$ is the prime graph of a finite solvable group if and only if its complement $\overline{\Gamma}$ is triangle-free and $3$-colorable—a result due to Gruber, Keller, Lewis, Naughton, and Strasser (Gruber et al., 2013). Among these, a minimal prime graph (MPG) is a connected graph with $|V(\Gamma)| > 1$ such that the removal of any edge results in a graph whose complement is no longer triangle-free or $3$-colorable. Equivalently, $\Gamma$ is an MPG if and only if $\overline{\Gamma}$ is a triangle-free, $3$-colorable graph that is edge-maximal with respect to those two properties; the addition of any edge to $\overline{\Gamma}$ creates a triangle or requires four colors (Dorton et al., 1 Feb 2026, Alvarez et al., 30 Nov 2025).

This characterization recasts the existence and enumeration of MPGs as a problem in extremal graph theory, connecting group-theoretic questions to structural analysis of triangle-free 3-chromatic graphs.

2. Structural Properties and Constructions

All MPGs are characterized by several distinctive features, both as graphs and in relation to the solvable groups they represent:

Induced $C_5$ : Every MPG-complement $\overline{\Gamma}$ contains at least one induced $5$-cycle ( $C_5$ ) (Florez et al., 2020, Dorton et al., 1 Feb 2026).
Minimum Degree: $\overline{\Gamma}$ has minimum degree at least $2$; if a degree-$2$ vertex exists, the structure of $\overline{\Gamma}$ is completely determined and is said to be reseminant (i.e., obtained from $C_5$ by finitely many vertex duplications) (Alvarez et al., 30 Nov 2025, Dorton et al., 1 Feb 2026).
Vertex Duplication: Duplicate any vertex by adding a "twin" with the same neighbors; this operation preserves both triangle-freeness and $3$-colorability and, when starting from $C_5$ , generates all reseminant MPGs (Gruber et al., 2013, Huang et al., 2022).
Infinite Families and Base Graphs: The smallest MPG is $C_5$ . Iterated vertex duplication from $C_5$ gives infinitely many MPGs (reseminant graphs). There also exist infinite families of non-duplicate-based MPGs via circulant construction and other generation methods, e.g., circulant Sidorenko–Zaran graphs for specific $n,k$ (Huang et al., 2022).
Alternatives to Duplication: Some MPGs on larger vertex sets are produced via "clique generation"—adjoining a vertex adjacent to all but a maximal clique using only two colors in some $3$-coloring of the complement.

Table: Key Structural Properties of MPGs

Property	Description	Source
Complement triangle-free	$\overline{\Gamma}$ has no $K_3$	(Gruber et al., 2013)
Complement $3$-colorable	$\chi(\overline{\Gamma}) = 3$	(Gruber et al., 2013)
Edge-maximal (in complement)	Adding any edge to $\overline{\Gamma}$ destroys (T) or (C)	(Gruber et al., 2013, Dorton et al., 1 Feb 2026)
Contains induced $C_5$	Every $\overline{\Gamma}$ contains $C_5$	(Florez et al., 2020, Dorton et al., 1 Feb 2026)
Minimum degree $\geq2$	No vertices of degree $1$ in $\overline{\Gamma}$	(Alvarez et al., 30 Nov 2025)
All edges in $5$-cycles	Every edge of $\overline{\Gamma}$ lies in an induced $C_5$	(Dorton et al., 1 Feb 2026)
Hamiltonian	Every MPG is Hamiltonian	(Florez et al., 2020)

3. Reseminant Graphs and Degree 2 Structure

A central structural dichotomy arises from the classification of degree-$2$ vertices in MPG-complements. If a minimal prime graph complement has a vertex of degree $2$, the entire graph is obtained from the $5$-cycle $C_5$ by a finite sequence of vertex duplications—forming the class of reseminant graphs. In this case, the only possible degree sequences correspond to arrangements where some three vertices in a $C_5$ (the two adjacent to the degree-$2$ vertices and the ceiling-opposite) are duplicated arbitrarily. This uniquely determines the graph up to isomorphism (Alvarez et al., 30 Nov 2025).

All reseminant graphs have many degree-$2$ vertices (those not selected for duplication), and these graphs are fully classified. Conversely, for $\delta \geq 3$ , the landscape of MPG-complements is vastly richer, admitting new infinite families via non-duplication constructions such as clique generation and circulant base graphs (Huang et al., 2022).

4. Cycle Structure and Extremal Configurations

Recent structural results demonstrate that every edge in a minimal prime graph complement is contained in an induced $5$-cycle; this is stronger than simply containing an induced $C_5$ —the cycles are pervasive, and the $5$-cycle property constrains local neighborhood structure substantially (Dorton et al., 1 Feb 2026).

This property connects the combinatorics of MPGs to extremal examples in bounding cycles in triangle-free 3-colorable graphs and informs both the possible automorphism groups (dominated by the product of symmetric groups on twin blocks) and recognition algorithms for testing whether a graph is an MPG-complement.

Further, MPGs are always Hamiltonian, while minimally connected prime graphs that are not MPGs (such as complete bridge graphs) may not be; in all MPGs, the abundance of $5$-cycles and clique structure among color classes in the complement ensures Hamiltonicity (Florez et al., 2020).

5. Algebraic and Spectral Invariants of MPGs

The adjacency matrix, determinant, and spectral invariants of principal MPG families—including complete bridge graphs, suspension graphs, and reseminant graphs—admit closed-form expressions:

For reseminant graphs built from $C_5$ , the determinant and spectrum involve "golden-ratio" eigenvalues, and the multiplicity of $-1$ correlates with the number of duplications.
For complete bridge graphs $B_{m,n}$ , determinant and eigenvalues follow from block matrix calculations, and their failure to be MPGs is reflected in spectral patterns (Florez et al., 2020).

These algebraic invariants provide tools both for distinguishing MPGs and for analyzing their automorphism groups and potential group-theoretic origins.

6. Group-Theoretic Constraints and Extremal Bounds

The group-theoretic relevance of MPGs is most acute in the classification of prime graphs of finite solvable groups. If $G$ is solvable and $\Gamma(G)$ is minimal:

$G$ achieves a maximal pattern of Frobenius actions among its Sylow subgroups.
The "3k-conjecture" holds: $\Omega(G) \leq 3\, o(G)$ , where $\Omega(G) = |\pi(G)|$ and $o(G) = \max_{g \in G} |\pi(o(g))|$ (Gruber et al., 2013).
Fitting length satisfies $3 \leq \ell_F(G) \leq 4$ , with the upper bound sharp only when a binary-octahedral subgroup ($2O$) appears as a section.

Reseminant graphs correspond to groups with a "C₅ plus clones" Frobenius action pattern, and explicit group constructions realize many MPGs, starting from $C_5$ -based Hall configurations and extending via semidirect product constructions.

7. Generalizations, Hereditary Classes, and Vertex-Minor Perspectives

Freestanding minimal prime graphs and their extensions play a fundamental role in hereditary graph classes, minimal ages, and indecomposable structures. In the hereditary poset of finite graphs, a minimal prime age contains infinitely many primes, but every proper hereditary subclass contains only finitely many. The classification of such ages bifurcates into a finite list of almost multichainable ages and an uncountable family associated to uniformly recurrent words; all minimal prime ages of permutation graphs arise via these constructions (Oudrar et al., 2022).

From the vertex-minor perspective, MPGs are those prime graphs for which every vertex is essential; the only such graphs (up to local equivalence) are cycles $C_n$ ( $n \geq 5$ ) and two-path graphs formed by pairs of internally disjoint paths between two poles, each of length at least $3$ (Kim et al., 2022). This axial property embeds MPGs into the framework of decomposability, splitting, and indecomposable extensions via modular decomposition and Bouchet's local complementation.