Hadwiger's Conjecture in Graph Theory

• Hadwiger's Conjecture is a fundamental open problem asserting that a graph's chromatic number is bounded by the size of its largest clique minor.
• It has been verified for graphs with t ≤ 6 using combinatorial proofs and asymptotic bounds, directly connecting to the Four-Color Theorem.
• Recent studies explore hereditary cases, defective colorings, and topological methods to extend the conjecture's reach for t ≥ 7.

Hadwiger’s Conjecture is a foundational open problem in extremal and structural graph theory relating the chromatic number of a finite undirected graph to the containment of clique minors. Its numerous variants, asymptotic relaxations, and hereditary cases have deep connections with graph coloring, graph minors, perfect graphs, and topological methods. The conjecture also has a namesake geometric version (Hadwiger's covering conjecture) in convex geometry, but the focus here is purely on the graph-theoretic statement and its ramifications.

1. Formal Statement and Basic Definitions

Hadwiger’s Conjecture states that for every finite simple graph $G$, the chromatic number $\chi(G)$ is at most the Hadwiger number $\eta(G)$, defined as the largest $t$ such that $G$ contains $K_t$ (the complete graph on $t$ vertices) as a minor:

$\forall\, G, \quad \eta(G) \geq \chi(G)$

Equivalently, a graph with no $K_{t+1}$ minor is $t$-colorable. A graph minor is obtained via a sequence of vertex deletions, edge deletions, and edge contractions (Postle, 2019). The variant for odd minors—where contractions must preserve odd cycle parities—is known as the odd Hadwiger’s Conjecture (Steiner, 2023, Steiner, 2021).

2. Exact and Asymptotic Results: Chromatic Bounds vs. Clique Minors

Hadwiger’s Conjecture holds for $\chi(G)$0: it is equivalent to the Four-Color Theorem for $\chi(G)$1; for $\chi(G)$2 the case was resolved combinatorially by Robertson, Seymour, and Thomas. For $\chi(G)$3 the conjecture remains open.

Asymptotic bounds are a cornerstone of work on the conjecture. The following upper bounds on the chromatic number for $\chi(G)$4-minor-free graphs have been established:

Bound	Authors	Statement
$\chi(G)$5	Kostochka, Thomason	For all $\chi(G)$6-minor-free $\chi(G)$7, $\chi(G)$8
$\chi(G)$9	Norin, Song	Improved the logarithmic exponent (Postle, 2019)
$\eta(G)$0 for any $\eta(G)$1	Song (2020)	Further improved bound (Postle, 2020)
$\eta(G)$2	Song (2020)	Exponential-in-double-logarithm bound (Postle, 2020)
$\eta(G)$3	Song (2020)	Polynomial-in-double-logarithm bound (Postle, 2020)

The central qualitative strengthening due to Gerards and Seymour is the Odd Hadwiger’s Conjecture, which asserts that every graph with chromatic number $\eta(G)$4 contains an odd $\eta(G)$5-minor (Steiner, 2023, Steiner, 2021).

3. Finite, Infinite, and Weak Variants

For infinite graphs, Hadwiger’s Conjecture fails: there exist connected graphs $\eta(G)$6 with $\eta(G)$7 but with no $\eta(G)$8 minor (Zypen, 2012). The “weak” form (for infinite cardinals $\eta(G)$9):

If $t$0, then $t$1 is a minor of $t$2.

holds for all infinite $t$3, but fails to capture the classical (finite) conjecture exactly (Zypen, 2013).

A notable related form is the defective coloring or partition form: Given $t$4 with no $t$5 minor, partition $t$6 into $t$7 classes such that the induced subgraph on each has bounded degree $t$8—a relaxation sharp up to maximum degree (Edwards et al., 2014).

4. Structural and Hereditary Classes: Forbidden Subgraphs and Stability Number

The case $t$9 (i.e., independence number at most 2) is pivotal. Seymour conjectured that resolving Hadwiger for this class would likely solve the general case (Costa et al., 18 Dec 2025). Substantial progress has been achieved for graphs with forbidden induced subgraphs and small independence number.

• Forbidden holes: If $G$0 with $G$1 has no holes (induced cycles) of length between $G$2 and $G$3, then $G$4. For $G$5, forbidding all holes of length $G$6 to $G$7 guarantees the odd Hadwiger bound $G$8 (Song et al., 2016).
• Specific hereditary classes: Hadwiger’s Conjecture holds for
  • $G$9-free graphs, each admitting a $K_t$0-minor model with all branch sets of size at most 2.
  • $K_t$1-free graphs, where all but possibly one branch set in the $K_t$2-minor model have size at most 2 (Carter et al., 27 May 2026).
• Forbidden induced subgraphs and minimum degree: If $K_t$3 is $K_t$4-free and $K_t$5, or $K_t$6 is $K_t$7-free with $K_t$8 and $K_t$9, then $t$0 (Li et al., 2023, Bosse, 2019).

For further hereditary classes and inflations (blow-ups) of special graphs, a variety of positive results for the $t$1 setting have been established (Costa et al., 18 Dec 2025).

5. Methodologies and Prototype Proofs

Classical and modern approaches employ a blend of extremal combinatorics, coloring, structural graph theory, and minor theory.

• Chromatic coordinate models: For $t$2, decomposing graphs into stacked parallel planes of limited chromatic number (e.g., two $t$3 minors on separate planes, interconnected to form $t$4) proves Hadwiger for all 8-colorable graphs (Wang et al., 2021).
• Packing and covering arguments: Use of cliques, matchings, and partitioning strategies (e.g., “maximal inflations of $t$5” in $t$6 settings) facilitate reduction to perfect graphs or forceable minor formation (Bosse, 2019, Li et al., 2023).
• Extremal and density bounds: Application of extremal function results (e.g., Mader’s bound for $t$7-minors) and iterative coloring via greedy approaches, together with the use of generalized Kempe chains and repair via disjoint paths (Lafferty et al., 2022, Wood, 2013).
• Defective colorings and relaxations: Partitioning into $t$8 parts inducing subgraphs of bounded maximum degree as an approach toward the $t$9-coloring goal, with explicit sharpness bounds (Edwards et al., 2014).
• Infinite graphs and tree-decompositions: For infinite chromatic number, equivalence with well-founded tree-decomposition width and colorability (Zypen, 2013).

6. Connections to Topological Bounds and Special Constructions

Topological lower bounds on chromatic number, such as the zig-zag number $\forall\, G, \quad \eta(G) \geq \chi(G)$0 and the Dol’nikov–Kříž bound, admit translated Hadwiger-type statements: every graph with $\forall\, G, \quad \eta(G) \geq \chi(G)$1 contains a $\forall\, G, \quad \eta(G) \geq \chi(G)$2 odd minor, and if the Dol’nikov–Kříž bound attains $\forall\, G, \quad \eta(G) \geq \chi(G)$3, then $\forall\, G, \quad \eta(G) \geq \chi(G)$4 admits a $\forall\, G, \quad \eta(G) \geq \chi(G)$5 as a minor (Steiner, 2023). For Kneser and Schrijver graphs, these bounds are tight.

Geometric analogues (Hadwiger's covering conjecture for convex bodies) are addressed for specific families like cap bodies in all dimensions $\forall\, G, \quad \eta(G) \geq \chi(G)$6 (Arman et al., 29 Oct 2025), but these geometric versions are distinct from the combinatorial statement.

7. Open Cases, Failures, and Future Directions

The original statement for $\forall\, G, \quad \eta(G) \geq \chi(G)$7 remains open—specifically, whether every $\forall\, G, \quad \eta(G) \geq \chi(G)$8-minor-free graph is 6-colorable or whether $\forall\, G, \quad \eta(G) \geq \chi(G)$9 for arbitrarily large chromatic number.

• Odd Hadwiger equivalence: Asymptotic bounds of the form $K_{t+1}$0 for $K_{t+1}$1-minor-free graphs are transferred up to a factor of 2 to the odd-minor variant (Steiner, 2021).
• Infinite cases: Hadwiger's Conjecture fails for infinite chromatic number; only a weaker form is true (Zypen, 2012, Zypen, 2013).
• Bounded defect partitions: Approaching the gap via defective coloring and component size, seeking $K_{t+1}$2 parts with bounded-size induced components remains open for $K_{t+1}$3 (Edwards et al., 2014).
• Further hereditary classes: Characterizing all hereditary classes $K_{t+1}$4 such that every $K_{t+1}$5 satisfies Hadwiger’s Conjecture or its strengthened branch-set models is a major ongoing effort (Costa et al., 18 Dec 2025, Carter et al., 27 May 2026).
• Search for counterexamples: Random triangle-free graph constructions and dense families not precluded by current results are candidate ground for possible counterexamples or further reductions (Costa et al., 18 Dec 2025).

Significant advances have come from increasingly precise structure theorems, forbidden subgraphs, and extremal bounds. Nonetheless, neither the core conjecture nor its combinatorial or topological analogues for large $K_{t+1}$6 have been fully settled. The problem remains central for graph theorists, with its resolution likely to have far-reaching implications across combinatorics and discrete mathematics.