Hadwiger conjecture (combinatorial geometry): Difference between revisions

Revision as of 21:56, 8 November 2011

Revision as of 10:47, 26 December 2012

Line 23:

==Known results==

The two-dimensional case was settled by {{harvtxt|Levi|1955}}: every two-dimensional bounded convex set may be covered with four smaller copies of itself, with the fourth copy needed only in the case of parallelograms. However, the conjecture remains open in higher dimensions except for some special cases. The best known upper bound on the number of smaller copies needed to cover a given body is

:<math>\displaystyle 42^n (5n\ln n).</math>

In three dimensions it is known that sixteen copies always suffice, but this is still far from the conjectured bound of eight copies.<ref name="BMP">{{harvtxt|Brass|Moser|Pach|2005}}.</ref>