There are two main conjectures known as "the Hadwiger conjecture" or "Hadwiger's conjecture":
*
*
See also
Wikimedia Foundation. 2010.
Hadwiger conjecture (graph theory) — 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 … Wikipedia
Conjecture d'Hadwiger — En théorie des graphes, la conjecture d Hadwiger est une conjecture très générale sur les problèmes de coloration de graphes. Formulée en 1943 par Hugo Hadwiger, elle énonce que si le graphe complet à k sommets, noté Kk, n est pas un mineur d un… … Wikipédia en Français
Conjecture de Hadwiger — En théorie des graphes, la conjecture de Hadwiger est une conjecture très générale sur les problèmes de coloration de graphes. Formulée en 1943 par Hugo Hadwiger, elle énonce que si le graphe complet à k sommets, noté Kk, n est pas un mineur d un … Wikipédia en Français
Hugo Hadwiger — (1908 ndash; 1981) was a Swiss mathematician. He is known for Hadwiger s theorem in integral geometry, and a number of conjectures. He also worked on a Swiss enhancement of the Enigma cipher machine, known as NEMA.His 1957 book Vorlesungen über… … Wikipedia
Hugo Hadwiger — in 1973 Hugo Hadwiger (1908 1981) était un mathématicien suisse. Il est connu pour le théorème d Hadwiger en géométrie intégrale, et un certain nombre de conjectures. En particulier, la conjecture d Hadwiger sur la coloration de graphes, est un… … Wikipédia en Français
Borsuk's conjecture — The Borsuk problem in geometry, for historical reasons incorrectly called a Borsuk conjecture, is a question in discrete geometry.ProblemIn 1932 Karol Borsuk has shownK. Borsuk, Drei Sätze über die n dimensionale euklidische Sphäre , Fundamenta… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… … Wikipedia
Four color theorem — Example of a four colored map A four colori … Wikipedia
List of unsolved problems in mathematics — This article lists some unsolved problems in mathematics. See individual articles for details and sources. Contents 1 Millennium Prize Problems 2 Other still unsolved problems 2.1 Additive number theory … Wikipedia
