Hadwiger conjecture (combinatorial geometry): Difference between revisions

Content deleted Content added
There was another known upper bound which is the best known bound for small n bigger than 3. This was reflected, reference included. Also some minor edits.
References: add to some refs
Line 38:
*{{citation|first1=Peter|last1=Brass|first2=William|last2=Moser|first3=János|last3=Pach|contribution=3.3 Levi–Hadwiger Covering Problem and Illumination|pages=136–142|title=Research Problems in Discrete Geometry|publisher=Springer-Verlag|year=2005}}.
*{{citation|first1=I. Ts.|last1=Gohberg|first2=A. S.|last2=Markus|format=In Russian|year=1960|title=A certain problem about the covering of convex sets with homothetic ones|journal=Izvestiya Moldavskogo Filiala Akademii Nauk SSSR|volume=10|issue=76|pages=87–90}}.
*{{citation|first=H.Hugo|last=Hadwiger|authorlink=Hugo Hadwiger|year=1957|title=Ungelöste Probleme Nr. 20|journal=Elemente der Mathematik|volume=12|pages=121}}.
*{{citation|first=M.Marek|last=Lassak|year=1988|title=Covering the boundary of a convex set by tiles|journal=[[Proceedings of the American Mathematical Society]]|volume=104|issue=1|pages=269-272|mr=0958081|doi=10.2307/2047500}}.
*{{citation|first=F.Friedrich W.Wilhelm|last=Levi|authorlink=Friedrich Wilhelm Levi|title=Überdeckung eines Eibereiches durch Parallelverschiebungen seines offenen Kerns|journal=[[Archiv der Mathematik]]|volume=6|year=1955|pages=369–370|issue=5|doi=10.1007/BF01900507}}.
 
[[Category:Discrete geometry]]