Hadwiger conjecture
any n-dimensional convex body can be covered by 2ⁿ smaller copies of itself
≈ 1 min read
Names in other languages
- Françaisconjecture de Hadwiger
- Españolconjetura de Hadwiger
- EnglishHadwiger conjecture
- Русскийгипотеза Хадвигера
- MagyarHadwiger-sejtés
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
There are several conjectures known as the Hadwiger conjecture or Hadwiger's conjecture. They include: * Hadwiger conjecture (graph theory), a relationship between the number of colors needed by a given graph and the size of its largest clique minor * Hadwiger conjecture (combinatorial geometry) that for any n-dimensional convex body, at most 2 n smaller homothetic bodies are necessary to contain the original * Hadwiger's conjecture on dissection into orthoschemes
There are several conjectures known as the Hadwiger conjecture or Hadwiger's conjecture. They include: Hadwiger conjecture (graph theory), a relationship between the number of colors needed by a given graph and the size of its largest clique minor Hadwiger conjecture (combinatorial geometry) that for any n-dimensional convex body, at most 2 n smaller homothetic bodies are necessary to contain the original Hadwiger's conjecture on dissection into orthoschemes
See also
Hadwiger–Nelson problem on the chromatic number of unit distance graphs in the Euclidean plane Hadwiger's theorem characterizing measure functions in Euclidean spaces
Text derived from https://en.wikipedia.org/w/index.php?oldid=819221239 under CC BY-SA 4.0; modifications have been made.