In graph theory, the Hadwiger conjecture states that if is loopless and has no minor then its chromatic number satisfies It is known to be true for 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 use or more colors, then one can find disjoint connected subgraphs of 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 on vertices as a minor This conjecture, a far-reaching generalization of the four-color problem, was made by Hugo Hadwiger in 1943 and is still unsolved. call it "one of the deepest unsolved problems in graph theory." 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 to the complete then must have a vertex coloring with colors. In a minimal of any contracting each color class of the coloring to a single vertex will produce a complete However, this contraction process does not produce a minor 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 in such a way that all the contracted sets are connected. If denotes the family of graphs having the property that all minors of graphs in can be then it follows from the Robertson–Seymour theorem that can be characterized by a finite set of forbidden minors. Hadwiger's conjecture is that this set consists of a single forbidden The Hadwiger number of a graph is the size of the largest complete graph that is a minor of (or equivalently can be obtained by contracting edges It is also known as the contraction clique number The Hadwiger conjecture can be stated in the simple algebraic form where denotes the chromatic number Special cases and partial results The case is trivial: a graph requires