Towards the Overfull Conjecture II

Abstract: Let $G$ be a simple graph with maximum degree $Δ(G)$. A subgraph $H\subseteq G$ is $Δ(G)$-overfull if $|E(H)|>Δ(G)\left\lfloor |V(H)|/2\right\rfloor$. In any edge coloring of $G$, each color class restricted to $H$ is a matching of size at most $\left\lfloor |V(H)|/2\right\rfloor$. Thus, if $G$ contains a $Δ(G)$-overfull subgraph, then $G$ cannot be edge-colored with only $Δ(G)$ colors. By Vizing's Theorem, $χ'(G)\le Δ(G)+1$, and hence $G$ is class $2$. In 1986, Chetwynd and Hilton conjectured that whenever $Δ(G)>|V(G)|/3$, the converse also holds: every class $2$ graph $G$ contains a $Δ(G)$-overfull subgraph. This statement, commonly known as the Overfull Conjecture, is one of the most influential conjectures in graph edge coloring. It would imply a polynomial-time algorithm for determining the chromatic index of graphs $G$ with $Δ(G)>|V(G)|/3$, and would also imply several other longstanding conjectures in the area, including the Just-overfull Conjecture and the Vertex-splitting Conjecture. In previous work, the third author verified the conjecture for large graphs $G$ with maximum degree at least $13|V(G)|/14$. In this paper, we confirm the conjecture for robust expanders satisfying certain density constraints. As a consequence, for every $0<\varepsilon<1$, the conjecture holds for all sufficiently large graphs $G$ with maximum degree at least $(1+\varepsilon)|V(G)|/2$.

• The paper confirms that robust expanders with high maximum degree satisfy the Overfull Conjecture, ensuring χ′(G)=Δ(G) if no overfull subgraph exists.
• It employs a three-stage methodology—trimming with layout techniques, deficiency-driven regularization, and balanced bipartition—to achieve full 1-factorizations.
• The advances bridge gaps in edge coloring theory and imply a polynomial-time algorithm for computing the chromatic index in high-density graph regimes.

Advancing the Overfull Conjecture in Edge Coloring: Robust Expanders and High-Density Regimes

Background and Problem Statement

The Overfull Conjecture posits that a simple graph $G$ with maximum degree $\Delta(G) > |V(G)|/3$ is of class 2 (i.e., has chromatic index $\chi'(G) = \Delta(G)+1$) if and only if $G$ contains a $\Delta(G)$-overfull subgraph, that is, a subgraph $H$ with $|E(H)| > \Delta(G)\lfloor |V(H)|/2 \rfloor$. By Vizing's Theorem, $\chi'(G) \leq \Delta(G) + 1$, but deciding whether a given graph achieves this upper bound is NP-complete for general graphs.

The Overfull Conjecture, formulated by Chetwynd and Hilton in 1986, is of particular significance because verifying it for the $\Delta > n/3$ regime would yield a polynomial-time algorithm for determining the chromatic index of such graphs and would resolve or imply several other prominent conjectures in edge coloring, including the Just-overfull and Vertex-splitting Conjectures, as well as versions of Vizing's Independence Number, $2$-Factor, and Average Degree Conjectures.

Prior to this work, the Overfull Conjecture had been established for high minimum degree regimes, notably for sufficiently large graphs with $\Delta(G) > |V(G)|/3$0 (Shan, 2023) and $\Delta(G) > |V(G)|/3$1 (Chetwynd and Hilton, 1988), but it remained unsettled for broader classes, especially in the absence of strong minimum degree conditions or within expanders.

Main Results and Methodology

This paper confirms the Overfull Conjecture for robust expanders under explicit polynomial-density constraints and demonstrates that, asymptotically, the conjecture holds for all sufficiently large graphs with maximum degree at least $\Delta(G) > |V(G)|/3$2 for any fixed $\Delta(G) > |V(G)|/3$3. The key formal results are as follows:

• Theorem 1: For every $\Delta(G) > |V(G)|/3$4, there exists $\Delta(G) > |V(G)|/3$5 such that if $\Delta(G) > |V(G)|/3$6 is a graph on $\Delta(G) > |V(G)|/3$7 vertices with $\Delta(G) > |V(G)|/3$8, then $\Delta(G) > |V(G)|/3$9 if and only if $\chi'(G) = \Delta(G)+1$0 contains no $\chi'(G) = \Delta(G)+1$1-overfull subgraph.
• Theorem 2: For every $\chi'(G) = \Delta(G)+1$2, there exists $\chi'(G) = \Delta(G)+1$3 such that for every $\chi'(G) = \Delta(G)+1$4, sufficiently large $\chi'(G) = \Delta(G)+1$5, and graph $\chi'(G) = \Delta(G)+1$6 on $\chi'(G) = \Delta(G)+1$7 vertices satisfying: (i) $\chi'(G) = \Delta(G)+1$8, (ii) a weak variant of Vizing's Adjacency Lemma (VAL), (iii) a small exceptional set of low simple-degree vertices, and (iv) being a robust $\chi'(G) = \Delta(G)+1$9-expander, one has $G$0 if and only if $G$1 contains no $G$2-overfull subgraph.

These results rule out the existence of class 2 counterexamples among expander graphs under these density conditions.

Key Technical Innovations

The proof follows a sophisticated three-stage reduction and decomposition:

1. Trimming via Layouts and Edge Removal: The graph is reduced through iterative matching removals that preserve expansion and target low-degree (“exceptional”) vertices without introducing overfull subgraphs. The design uses layouts akin to those in the matching polytope literature, and robust expansion ensures these deletions preserve the necessary global structure.
2. Regularization and Canonical Completion: The trimmed graph, which may be irregular and of odd order, is regularized via the addition of a sparse multigraph, constructed using an explicit canonical completion guided by deficiency sequences. The underlying simple graph remains a robust expander, and care is taken to ensure that added edges avoid creating new overfull subgraphs.
3. Decomposition via Balanced Bipartition and 1-Factorization: Leveraging the regularity lemma and robust expansion, a balanced bipartition is established such that the bipartite subgraph inherits robust expansion. A color-prescribed alternating path argument (related to augmenting paths in perfect matchings and robust connectivity) is used to extend partial colorings into full 1-factorizations. The remaining bipartite multigraphs are handled by Kőnig’s edge-coloring theorem. The process is effective even in the presence of fat triangles and other potential local obstacles due to the global expansion.

Strong numerical bounds are achieved: the proof manages exceptional sets of size $G$3 and controls all parameters in relation to explicit expansion and degree thresholds.

Numerical Claims and Contradictory Cases

The paper establishes that any minimal counterexample to the Overfull Conjecture with $G$4 and sufficiently large $G$5 (i) cannot be a robust expander for any relevant choice of parameters, and (ii) if it is, then an explicit construction yields a contradiction—therefore, the focus shifts to highly non-expanding graphs for remaining potential counterexamples.

Notably, the graph $G$6 (the Petersen graph with one vertex removed) remains the unique sharpness example at the $G$7 threshold, containing no $G$8-overfull subgraphs but possessing $G$9.

Implications and Theoretical Significance

This work closes the Overfull Conjecture for robust expanders and, via robust expansion reductions, for graphs with high maximum degree—significantly extending previous results beyond minimum degree regimes. Practically, this confirms that the chromatic index is determined by the absence of overfull subgraphs in the entire high-degree/expander domain, making $\Delta(G)$0 polynomial-time computable in this regime.

Theoretically, these results imply progress or resolution for several conjectures in edge coloring, factorization, and structural graph theory for the relevant degree regime, by confirming that overfull subgraphs are the essential obstruction.

Furthermore, the techniques developed—especially the integration of deficiency-driven regularization, layout trimming in expanders, and canonical completions—are broadly applicable in extremal, probabilistic, and algorithmic graph theory, particularly for multigraph and edge-coloring problems in expansive or pseudo-random settings.

Prospects for Future Research

The paper suggests that the real focus for the Overfull Conjecture now narrows to non-expanding, possibly highly structured or decomposable critical graphs with $\Delta(G)$1. The methods devised here may facilitate further reductions or structural theorems, and the interplay between robust expansion, regularity, and edge coloring has clear potential in attacking related divisor-type conjectures.

Future progress may require deeper understanding or classification of non-expanding, class~2 critical graphs or new combinatorial extremal tools to handle such graphs when expansion cannot be imposed.

Conclusion

This work provides a definitive resolution of the Overfull Conjecture for robust expanders and for dense graphs above the $\Delta(G)$2 maximum degree threshold, using a refined combination of trimming, regularization, and robust bipartite decomposition. It eliminates all robustly expanding potential counterexamples for large $\Delta(G)$3, cements the centrality of overfull subgraphs in determining edge colorability, and establishes strong technical machinery for future explorations in edge coloring and factorization.