Content deleted Content added
Andriy prm (talk | contribs) 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=
*{{citation|first=
*{{citation|first=
[[Category:Discrete geometry]]
|