Unsolved problem in mathematics:

Does every graph with chromatic number ${\displaystyle k}$ have a ${\displaystyle k}$-vertex complete graph as a minor?

In graph theory, the Hadwiger conjecture states that if ${\displaystyle G}$ is loopless and has no ${\displaystyle K_{t}}$ minor then its chromatic number satisfies ${\displaystyle \chi (G). It is known to be true for ${\displaystyle 1\leq t\leq 6}$. The conjecture is a generalization of the four-color theorem and is considered to be one of the most important and challenging open problems in the field.

In more detail, if all proper colorings of an undirected graph ${\displaystyle G}$ use ${\displaystyle k}$ or more colors, then one can find ${\displaystyle k}$ disjoint connected subgraphs of ${\displaystyle G}$ such that each subgraph is connected by an edge to each other subgraph. Contracting the edges within each of these subgraphs so that each subgraph collapses to a single vertex produces a complete graph ${\displaystyle K_{k}}$ on ${\displaystyle k}$ vertices as a minor of ${\displaystyle G}$.

This conjecture, a far-reaching generalization of the four-color problem, was made by Hugo Hadwiger in 1943 and is still unsolved.[1] Bollobás, Catlin & Erdős (1980) call it "one of the deepest unsolved problems in graph theory."[2]

## Equivalent forms

An equivalent form of the Hadwiger conjecture (the contrapositive of the form stated above) is that, if there is no sequence of edge contractions (each merging the two endpoints of some edge into a single supervertex) that brings a graph ${\displaystyle G}$ to the complete graph ${\displaystyle K_{k}}$, then ${\displaystyle G}$ must have a vertex coloring with ${\displaystyle k-1}$ colors.

In a minimal ${\displaystyle k}$-coloring of any graph ${\displaystyle G}$, contracting each color class of the coloring to a single vertex will produce a complete graph ${\displaystyle K_{k}}$. However, this contraction process does not produce a minor of ${\displaystyle G}$ because there is (by definition) no edge between any two vertices in the same color class, thus the contraction is not an edge contraction (which is required for minors). Hadwiger's conjecture states that there exists a different way of properly edge contracting sets of vertices to single vertices, producing a complete graph ${\displaystyle K_{k}}$, in such a way that all the contracted sets are connected.

If ${\displaystyle {\mathcal {F}}_{k}}$ denotes the family of graphs having the property that all minors of graphs in ${\displaystyle {\mathcal {F}}_{k}}$ can be ${\displaystyle (k-1)}$-colored, then it follows from the Robertson–Seymour theorem that ${\displaystyle {\mathcal {F}}_{k}}$ can be characterized by a finite set of forbidden minors. Hadwiger's conjecture is that this set consists of a single forbidden minor, ${\displaystyle K_{k}}$.

The Hadwiger number ${\displaystyle h(G)}$ of a graph ${\displaystyle G}$ is the size ${\displaystyle k}$ of the largest complete graph ${\displaystyle K_{k}}$ that is a minor of ${\displaystyle G}$ (or equivalently can be obtained by contracting edges of ${\displaystyle G}$). It is also known as the contraction clique number of ${\displaystyle G}$.[2] The Hadwiger conjecture can be stated in the simple algebraic form ${\displaystyle \chi (G)\leq h(G)}$ where ${\displaystyle \chi (G)}$ denotes the chromatic number of ${\displaystyle G}$.

## Special cases and partial results

The case ${\displaystyle k=2}$ is trivial: a graph requires more than one color if and only if it has an edge, and that edge is itself a ${\displaystyle K_{2}}$ minor. The case ${\displaystyle k=3}$ is also easy: the graphs requiring three colors are the non-bipartite graphs, and every non-bipartite graph has an odd cycle, which can be contracted to a 3-cycle, that is, a ${\displaystyle K_{3}}$ minor.

In the same paper in which he introduced the conjecture, Hadwiger proved its truth for ${\displaystyle k=4}$. The graphs with no ${\displaystyle K_{4}}$ minor are the series–parallel graphs and their subgraphs. Each graph of this type has a vertex with at most two incident edges; one can 3-color any such graph by removing one such vertex, coloring the remaining graph recursively, and then adding back and coloring the removed vertex. Because the removed vertex has at most two edges, one of the three colors will always be available to color it when the vertex is added back.

The truth of the conjecture for ${\displaystyle k=5}$ implies the four color theorem: for, if the conjecture is true, every graph requiring five or more colors would have a ${\displaystyle K_{5}}$ minor and would (by Wagner's theorem) be nonplanar. Klaus Wagner proved in 1937 that the case ${\displaystyle k=5}$ is actually equivalent to the four color theorem and therefore we now know it to be true. As Wagner showed, every graph that has no ${\displaystyle K_{5}}$ minor can be decomposed via clique-sums into pieces that are either planar or an 8-vertex Möbius ladder, and each of these pieces can be 4-colored independently of each other, so the 4-colorability of a ${\displaystyle K_{5}}$-minor-free graph follows from the 4-colorability of each of the planar pieces.

Robertson, Seymour & Thomas (1993) proved the conjecture for ${\displaystyle k=6}$, also using the four color theorem; their paper with this proof won the 1994 Fulkerson Prize. It follows from their proof that linklessly embeddable graphs, a three-dimensional analogue of planar graphs, have chromatic number at most five.[3] Due to this result, the conjecture is known to be true for ${\displaystyle k\leq 6}$, but it remains unsolved for all ${\displaystyle k>6}$.

For ${\displaystyle k=7}$, some partial results are known: every 7-chromatic graph must contain either a ${\displaystyle K_{7}}$ minor or both a ${\displaystyle K_{4,4}}$ minor and a ${\displaystyle K_{3,5}}$ minor.[4]

Every graph ${\displaystyle G}$ has a vertex with at most ${\textstyle O{\bigl (}h(G){\sqrt {\log h(G)}}{\bigr )}}$ incident edges,[5] from which it follows that a greedy coloring algorithm that removes this low-degree vertex, colors the remaining graph, and then adds back the removed vertex and colors it, will color the given graph with ${\textstyle O{\bigl (}h(G){\sqrt {\log h(G)}}{\bigr )}}$ colors.

In the 1980s, Alexander V. Kostochka[6] and Andrew Thomason[7] both independently proved that every graph with no ${\displaystyle K_{k}}$ minor has average degree ${\textstyle O(k{\sqrt {\log k}})}$ and can thus be colored using ${\textstyle O(k{\sqrt {\log k}})}$ colors. A sequence of improvements to this bound have led to a proof of ${\displaystyle O(k\log \log k)}$-colorability for graphs without ${\displaystyle K_{k}}$ minors.[8]

## Generalizations

György Hajós conjectured that Hadwiger's conjecture could be strengthened to subdivisions rather than minors: that is, that every graph with chromatic number ${\displaystyle k}$ contains a subdivision of a complete graph ${\displaystyle K_{k}}$. Hajós' conjecture is true for ${\displaystyle k\leq 4}$, but Catlin (1979) found counterexamples to this strengthened conjecture for ${\displaystyle k\geq 7}$; the cases ${\displaystyle k=5}$ and ${\displaystyle k=6}$ remain open.[9] Erdős & Fajtlowicz (1981) observed that Hajós' conjecture fails badly for random graphs: for any ${\displaystyle \varepsilon >0}$, in the limit as the number of vertices, ${\displaystyle n}$, goes to infinity, the probability approaches one that a random ${\displaystyle n}$-vertex graph has chromatic number ${\displaystyle \geq ({\tfrac {1}{2}}-\varepsilon )n/\log _{2}n}$, and that its largest clique subdivision has ${\textstyle O({\sqrt {n}})}$ vertices. In this context, it is worth noting that the probability also approaches one that a random ${\displaystyle n}$-vertex graph has Hadwiger number greater than or equal to its chromatic number, so the Hadwiger conjecture holds for random graphs with high probability; more precisely, the Hadwiger number is with high probability proportional to ${\textstyle n/{\sqrt {\log n}}}$.[2]

Borowiecki (1993) asked whether Hadwiger's conjecture could be extended to list coloring. For ${\displaystyle k\leq 4}$, every graph with list chromatic number ${\displaystyle k}$ has a ${\displaystyle k}$-vertex clique minor. However, the maximum list chromatic number of planar graphs is 5, not 4, so the extension fails already for ${\displaystyle K_{5}}$-minor-free graphs.[10] More generally, for every ${\displaystyle t\geq 1}$, there exist graphs whose Hadwiger number is ${\displaystyle 3t+1}$ and whose list chromatic number is ${\displaystyle 4t+1}$.[11]

Gerards and Seymour conjectured that every graph ${\displaystyle G}$ with chromatic number ${\displaystyle k}$ has a complete graph ${\displaystyle K_{k}}$ as an odd minor. Such a structure can be represented as a family of ${\displaystyle k}$ vertex-disjoint subtrees of ${\displaystyle G}$, each of which is two-colored, such that each pair of subtrees is connected by a monochromatic edge. Although graphs with no odd ${\displaystyle K_{k}}$ minor are not necessarily sparse, a similar upper bound holds for them as it does for the standard Hadwiger conjecture: a graph with no odd ${\displaystyle K_{k}}$ minor has chromatic number ${\textstyle \chi (G)=O{\bigl (}k{\sqrt {\log k}}{\bigr )}}$.[12]

By imposing extra conditions on ${\displaystyle G}$, it may be possible to prove the existence of larger minors than ${\displaystyle K_{k}}$. One example is the snark theorem, that every cubic graph requiring four colors in any edge coloring has the Petersen graph as a minor, conjectured by W. T. Tutte and announced to be proved in 2001 by Robertson, Sanders, Seymour, and Thomas.[13]

## Notes

1. ^
2. ^ a b c
3. ^
4. ^ The existence of either a ${\displaystyle K_{7}}$ or ${\displaystyle K_{3,5}}$ minor was shown by Ken-ichi Kawarabayashi, and Kawarabayashi & Toft (2005) proved the existence of either a ${\displaystyle K_{7}}$ or ${\displaystyle K_{4,4}}$ minor.
5. ^ Kostochka (1984). The letter ${\displaystyle O}$ in this expression invokes big O notation.
6. ^
7. ^
8. ^
9. ^
10. ^
11. ^
12. ^
13. ^