Hadwiger conjecture (combinatorial geometry)

In combinatorial geometry, the Hadwiger conjecture states that any convex body in n-dimensional Euclidean space can be covered by 2n or fewer smaller bodies homothetic with the original body, and that furthermore, the upper bound of 2n is necessary if and only if the body is a parallelepiped. There also exists an equivalent formulation in terms of the number of floodlights needed to illuminate the body.

Source: Wikipedia — Hadwiger conjecture (combinatorial geometry) (CC BY-SA 4.0)

Hadwiger conjecture (combinatorial geometry)

In combinatorial geometry, the Hadwiger conjecture states that any convex body in n-dimensional Euclidean space can be covered by 2n or fewer smaller bodies homothetic with the original body, and that furthermore, the upper bound of 2n is necessary if and only if the body is a parallelepiped. There also exists an equivalent formulation in terms of the number of floodlights needed to illuminate the body.

Source: Wikipedia "Hadwiger conjecture (combinatorial geometry)" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy