[Paper Review] A proof of the Total Coloring Conjecture

T. Srinivasa Murthy|arXiv (Cornell University)|Mar 21, 2020

Limits and Structures in Graph Theory9 references4 citations

TL;DR

This paper presents a proof of the Total Coloring Conjecture, establishing that the total chromatic number χ′′(G) of any finite simple graph G is at most Δ + 2, where Δ is the maximum degree. The authors employ algebraic techniques over a finite field Z_p, leveraging polynomial constructions and Vizing’s theorem to demonstrate the existence of a valid total coloring using Δ + 2 colors.

ABSTRACT

extit{Total Coloring} of a graph is a major coloring problem in combinatorial mathematics, introduced in the early $1960$s. A extit{total coloring} of a graph $G$ is a map $f:V(G) \cup E(G) ightarrow \mathcal{K}$, where $\mathcal{K}$ is a set of colors, satisfying the following three conditions: 1. $f(u) eq f(v)$ for any two adjacent vertices $u, v \in V(G)$; 2. $f(e) eq f(e')$ for any two adjacent edges $e, e' \in E(G)$; and 3. $f(v) eq f(e)$ for any vertex $v \in V(G)$ and any edge $e \in E(G)$ that is incident to the same vertex $v$. The extit{total chromatic number}, $χ''(G)$, is the minimum number of colors required for a extit{total coloring} of $G$. Behzad (1965), and Vizing (1968), conjectured that for any graph $G$ $χ''(G)\leq Δ+ 2$. This conjecture is one of the classic unsolved mathematical problems. In this paper, we settle this classical conjecture by proving that the extit{total chromatic number} $χ''(G)$ of a graph is indeed bounded above by $Δ+2$. Our novel approach involves algebraic settings over a finite field $\mathbb{Z}_p$ and Vizing's theorem is an essential part of the algebraic settings.

Motivation & Objective

• To resolve the longstanding Total Coloring Conjecture, a major open problem in graph theory since the 1960s.
• To prove that the total chromatic number χ′′(G) of any finite simple graph G is bounded above by Δ + 2.
• To establish a constructive algebraic framework over a finite field Z_p to model and verify total colorings.
• To unify edge and vertex coloring constraints via polynomial systems that encode coloring conflicts.
• To demonstrate that a total coloring with Δ + 2 colors always exists, confirming Behzad and Vizing’s conjecture.

Proposed method

• Construct a polynomial F over the finite field Z_p with p ≥ m²(2Δ + 2), where p is prime.
• Define a coefficient polynomial P′(v₁,…,vₙ,e₁,…,eₘ) that encodes all constraints of total coloring: adjacent vertices, adjacent edges, and vertex-edge conflicts.
• Use Fermat’s Little Theorem (x^p ≡ x mod p) to model color assignments via polynomial identities.
• Apply Lemma 3.2 and Lemma 3.3 to iteratively assign edge colors β_{e_i} ∈ {1,2,…,Δ+1,α} such that the edge coloring is proper.
• Prove that the coefficient of the monomial ∏v_i^{l_i} in P′ is nonzero modulo p, ensuring existence of valid vertex colorings.
• Use the Combinatorial Nullstellensatz-like argument to show that there exists an assignment of colors to vertices and edges satisfying all constraints.

Experimental results

Research questions

• RQ1 Can the Total Coloring Conjecture χ′′(G) ≤ Δ + 2 be proven using algebraic methods over finite fields?
• RQ2 Is it possible to construct a polynomial system over Z_p that encodes all total coloring constraints (vertex, edge, and vertex-edge conflicts) simultaneously?
• RQ3 Does the existence of a nonzero coefficient in a multivariate polynomial over Z_p guarantee a valid total coloring with Δ + 2 colors?
• RQ4 Can Vizing’s theorem on edge coloring be integrated into an algebraic framework to prove the total coloring bound?
• RQ5 Does the proposed method yield a constructive proof of total coloring for all finite simple graphs?

Key findings

• The paper proves that χ′′(G) ≤ Δ + 2 for all finite simple graphs G, confirming the Total Coloring Conjecture.
• A total coloring using Δ + 2 colors exists for any graph, as demonstrated by the existence of a nonzero evaluation of the constructed polynomial P′ modulo p.
• The edge coloring is constructed iteratively using Lemma 3.2 and Lemma 3.3, ensuring adjacent edges receive distinct colors.
• The vertex coloring is derived from the nonzero coefficient of ∏v_i^{l_i} in P′, guaranteeing that no vertex shares a color with its incident edges or adjacent vertices.
• The color α ∈ Z_p ∖ {1,2,…,Δ+1} is used as a distinct color to resolve conflicts between vertex and edge color assignments.
• The proof is constructive in the sense that the existence of a valid coloring is guaranteed by algebraic non-vanishing of a polynomial over a finite field.