Hadwiger conjecture (combinatorial geometry)
id:
hadwiger-conjecture-combinatorial-geometry-221-664241
title:
Hadwiger conjecture (combinatorial geometry)
text:
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. The Hadwiger conjecture is named after Hugo Hadwiger, who included it on a list of unsolved p
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Hadwiger_conjecture_(combinatorial_geometry)
date created:
2009-03-06T23:02:42Z
date modified:
2024-09-13T16:17:30Z
main entity:
{"identifier":"Q5638115","url":"https://www.wikidata.org/entity/Q5638115"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/4f/Hadwiger_covering.svg","width":437,"height":195}
fields total:
13
integrity:
15