Hadwiger conjecture

English

Alternative forms

Etymology

Named after Hugo Hadwiger.

Proper noun

the Hadwiger conjecture

  1. (graph theory) A conjecture regarding the relationship between the number of colors needed by a given graph and the size of its largest clique minor.
  2. (geometry) The conjecture that at most 2n smaller homothetic bodies are necessary to contain any single given n-dimensional convex body.
  3. (geometry) The conjecture that every simplex can be dissected into orthoschemes, using a number of orthoschemes bounded by a function of the dimension of the simplex.