Hadwiger conjecture (graph theory)

From Wikipedia, the free encyclopedia

Unsolved problems in mathematics: is every Kk-minor-free graph colorable with k − 1 colors?
A graph that requires four colors in any coloring, and four connected subgraphs that, when contracted, form a complete graph (each subgraph has an edge connecting it to each other subgraph), illustrating the case k = 4 of Hadwiger's conjecture
A graph that requires four colors in any coloring, and four connected subgraphs that, when contracted, form a complete graph (each subgraph has an edge connecting it to each other subgraph), illustrating the case k = 4 of Hadwiger's conjecture

In graph theory, the Hadwiger conjecture (or Hadwiger's conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of 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 supervertex produces a complete graph Kk on k vertices as a minor of G.

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

Contents

[edit] 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 graph G to the complete graph Kk, then G must have a vertex coloring with k − 1 colors.

Note that, in a minimal k-coloring of any graph G, contracting each color class of the coloring to a single vertex will produce a complete graph Kk. However, this contraction process does not produce a minor of G because the contracted sets of vertices are not in general connected. Hadwiger's conjecture states that there exists a different way of contracting sets of vertices to single vertices, producing a complete graph Kk, in such a way that all the contracted sets are connected.

If Fk denotes the family of graphs having the property that all minors of graphs in Fk can be (k − 1)-colored, then it follows from the Robertson–Seymour theorem that Fk can be characterized by a finite set of forbidden minors. Hadwiger's conjecture is that this set consists of a single forbidden minor, Kk.

[edit] Special cases

The case where 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 K2 minor. The case 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 K3 minor.

In the same paper in which he introduced the conjecture, Hadwiger proved its truth for k ≤ 4. The graphs with no K4 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 vertex has at most two edges, one of the three colors will always be available to color it.

The truth of the conjecture for k = 5 implies the four color theorem: for, if the conjecture is true, every graph requiring five or more colors would have a K5 minor and would (by Wagner's theorem) be nonplanar. Klaus Wagner proved in 1937 that the case 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 K5 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 K5-free graph follows from the 4-colorability of each of the planar pieces.

Robertson, Seymour & Thomas (1993) proved the conjecture for k = 6, also using the four color theorem. Thus the conjecture is true for k ≤ 6 but it remains unsolved for all k > 6.

For k = 7, some partial results are known: every 7-chromatic graph must contain either a K7 minor or both a K4,4 minor and a K3,5 minor.[2]

[edit] Hadwiger number

The Hadwiger number h(G) of a graph G is the size k of the largest complete graph Kk that is a minor of G (or equivalently can be obtained by contracting edges of G). It is also known as the contraction clique number of G.[1] The Hadwiger conjecture can be stated in the simple algebraic form χ(G) ≤ h(G) where χ(G) denotes the chromatic number of G. A related concept, the achromatic number of G, is the size of the largest clique that can be formed by contracting a family of independent sets in G).

Determining the Hadwiger number of a given graph is fixed-parameter tractible: there is an algorithm for finding the largest clique minor in an amount of time that depends only polynomially on the size of the graph, but exponentially in h(G).[3] Alon, Lingas & Wahlen (2006) consider approximation algorithms for finding large clique minors in graphs, and observe that (unless P=NP) polynomial time algorithms can approximate the Hadwiger number significantly more accurately than the best possible approximation to the size of the largest clique in a graph.

It is known that every graph G with h(G) = k has a vertex with at most O(k √log k) incident edges.[4] By removing this low-degree vertex, coloring the remaining graph, and then adding back the removed vertex and coloring it, one can show that χ(G) = O(k √log k).

[edit] 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 k contains a subdivision of a complete graph Kk. Hajós' conjecture is true for k ≤ 4, but Catlin (1979) found counterexamples to this strengthened conjecture for k ≥ 7; the cases k = 5 and k = 6 remain open.[5] Erdős & Fajtlowicz (1981) observed that Hajós' conjecture fails badly for random graphs: for any ε > 0, in the limit as the number of vertices, n, goes to infinity, the probability approaches one that a random n-vertex graph has chromatic number ≥ (1/2 − ε)n / log2 n, and that its largest clique subdivision has at most cn1/2 vertices for some constant c. In this context it is worth noting that the probability also approaches one that a random 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 a constant times n/√log n.[6]

Gerards and Seymour conjectured that every graph G with chromatic number k has a complete graph Kk as an odd minor. Such a structure can be represented as a family of k vertex-disjoint subtrees of G, each of which is two-colored, such that each pair of subtrees is connected by a monochromatic edge. Although graphs with no odd Kk minor are not necessarily sparse, Geelen et al. (2006) show that a similar upper bound holds for them as it does for the standard Hadwiger conjecture: a graph with no odd Kk minor has chromatic number χ(G) = O(k √log k).

[edit] Notes

  1. ^ a b Bollobás, Catlin & Erdős (1980).
  2. ^ The existence of either a K7 or K3,5 minor was shown by Kawarabayashi, and Kawarabayashi & Toft (2005) proved the existence of either a K7 or K4,4 minor.
  3. ^ Alon, Lingas & Wahlen (2006).
  4. ^ Kostochka (1984). The letter O in this expression invokes big O notation.
  5. ^ Yu & Zickfeld (2006).
  6. ^ Bollobás, Catlin & Erdős (1980).

[edit] References

  • Catlin, P. A. (1979), “Hajós's graph-colouring conjecture: variations and counterexamples”, Journal of Combinatorial Theory, Series B 26: 268–274 .
  • Hadwiger, Hugo (1943), “Über eine Klassifikation der Streckenkomplexe”, Vierteljschr. Naturforsch. ges. Zürich 88: 133–143 .
  • Kawarabayashi, Ken-ichi, Minors in 7-chromatic graphs, Preprint .
  • Wagner, Klaus (1937), “Über eine Eigenschaft der ebenen Komplexe”, Mathematische Annalen 114: 570–590 .
Languages