The problems of Borsuk and Grünbaum on lattice polytopes

Izvestiya Mathematics

Volumn 69, Issue 3, 2005, Pages 513-537

  Raigorodskii, A M ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645455244     PISSN: 10645632     EISSN: 14684810     Source Type: Journal    
DOI: 10.1070/IM2005v069n03ABEH000537     Document Type: Article

References (44)

1. K. Borsuk, "Drei Sätze über die n-dimensionale Euklidische Sphäre", Fundam. Math. 20 (1933), 177-190.
2. L. Danzer, B. Grünbaum, and V. Klee, "Helly's theorem and its relatives", Proc. Symp. Pure Math., vol. 7, Amer. Math. Soc., Providence 1963, pp. 101-180; Russian transl., Mir, Moscow 1968.
3. H. Hadwiger and H. Debrunner, Kombinatorische Geometrie in der Ebene, Monographies de L'Enseignement Math., no. 2, Institute de Math., Genève 1960; English transl., Holt, Reinhart and Winston, 1964; Russian transl., Nauka, Moscow 1965.
4. H. Lenz, "Über die Bedeckung ebener Punktmengen durch solche kleineren Durchmessers", Arch. Math. 4 (1956), 34-40.
5. J. Schopp, "Die Abdeckung ebener Bereiche mit konstanten Durchmessern durch drei Kreise von kleinerem Durchmesser", Vortrag, gehalten auf der Geometrie-Tagen in Tihany, Hungary 1965.
6. V. G. Boltyanski and I. Ts. Gokhberg, Results and problems in combinatorial geometry, Nauka, Moscow 1965; English transl., Cambridge Univ. Press, Cambridge 1985.
7. V. G. Boltyanski, H. Martini, and P. S. Soltan, Excursions into combinatorial geometry, Springer-Verlag, Berlin-Heidelberg 1997.
8. H. Hadwiger, "Überdeckung einer Menge durch Mengen kleineren Durchmessers", Comm. Math. Helv. 18 (1945/46), 73-75;
9. "Mitteilung betreffend meine Note: Überdeckung einer Menge durch Mengen kleineren Durchmessers", Comm. Math. Helv. 19 (1946/47), 72-73.
10. J. Kahn and G. Kalai, "A counterexample to Borsuk's conjecture", Bull. Amer. Math. Soc. 29:1 (1993), 60-62.
11. A. M. Raigorodskii, "On a bound in Borsuk's problem", Uspekhi Mat. Nauk 54:2 (1999), 185-186;
12. English transl., Russian Math. Surveys 54 (1999), 453-454.
13. C. A. Rogers, "Covering a sphere with spheres", Mathematika 10 (1963), 157-164.
14. O. Schramm, "Illuminating sets of constant width", Mathematika 35 (1988), 180-189.
15. d by balls of the same diameter". Geometric aspects of functional analysis (J. Lindenstrauss and V. Milman, eds.), Lecture Notes in Math., no. 1469, Springer-Verlag, Berlin 1991, pp. 138-144.
16. A. M. Raigorodskii, "The Borsuk problem and the chromatic numbers of some metric spaces", Uspekhi Mat. Nauk 56:1 (2001), 107 146;
17. d and a problem of Grünbaum", Proc. Colloquium on Convexity, Copenhagen 1965, p. 41.
18. F. Schiller, Zur Berechnung und Abschälzung von Färbungszahlen und der υ-Funktion von Graphen, Diplomarbeit, TU, Berlin 1999.
19. J. Petersen, Färbung von Borsuk- Graphen in niedriger Dimension, Diplomarbeit, TU, Berlin 1998.
20. C. Payan, "On the chromatic number of cube-like graphs", Discrete Math. 103 (1992), 271-277.
21. G. M. Ziegler, "Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions", Lect. Notes Comput. Sci. 2122 (2001), 159-171.
22. G. M. Ziegler, "Lectures on 0/1-polytopes", Polytopes-combinatorics and computation (G. Kalai and G. M. Ziegler, eds.), DMV-seminar 29, Birkhäuser-Verlag, Basel 2000, pp. 1-44.
23. A. M. Raigorodskii, "The Borsuk problem for (0, 1)-polyhedra and cross-polytopes", Dokl. Ross. Akad. Nauk 371 (2000), 600-603;
24. English transl., Dokl. Math. 65 (2000), 256-259.
25. A. M. Raigorodskii, "The Borsuk problem for (0, 1)-polytopes and cross-polytopes", Dokl. Ross. Akad. Nauk 384 (2002), 593-597;
26. English transl., Dokl. Math. 65 (2002), 413-416.
27. A. M. Raigorodskii, "The Borsuk problem for integral polytopes", Mat. Sb. 193:10 (2002), 139-160;
28. English transl., Sb. Math. 193 (2002), 1535-1556.
29. A. M. Raigorodskii, "The problems of Borsuk, Hadwiger, and Grünbaum for some classes of polytopes and graphs", Dokl. Ross. Akad. Nauk 388 (2003), 738-742;
30. English transl., Dokl. Math. 67 (2003), 85-89.
31. A. M. Raigorodskii, The Borsuk partition problem, London Math. Soc. Lect. Note Series, Cambridge Univ. Press, Cambridge 2005.
32. A. M. Raigorodskii, "On the problem of optimal covering of a set by balls", Chebyshev Sbornik 3:2 (2002), 100-106. (Russian)
33. N. Linial, R. Meshulam, and M. Tarsi, "Matroidal bijections between graphs", J. Combin. Theory Ser. B 45:1 (1988), 31-44.
34. A. M. Raigorodskii, "Systems of common representatives", Fundam. Prikl. Mat. 5 (1999), 851-860. (Russian)
35. N. N. Kuzyurin, "Asymptotic investigation of the set covering problem", Probl. Kibernet. 1980, no. 37, 19-56. (Russian)
36. P. Turán, "An extremal problem in graph theory", Mat. Fiz. Lapok 48 (1941), 436-452. (Hungarian)
37. G. Katona, T. Nemetz, and M. Simonovitz, "On a graph problem of Turán", Mat. Lapok 15 (1964), 228-238. (Hungarian)
38. Z. Füredi, "Turán's type problems", Surveys in Combinatorics Proc. of the 13th British Combin. Conference (A. D. Keedwell, ed.), Cambridge Univ. Press, Cambridge 1991, pp. 253-300.
39. A. M. Raigorodskii, "The defects of admissible balls and octahedra in a lattice, and systems of common representatives", Mat. Sb. 189:6 (1998), 117-141;
40. English transl., Sb. Math. 189 (1998), 931-954.
41. J. W. S. Cassels, An introduction to the geometry of numbers, Springer-Verlag, Berlin-Göttingen 1959; Russian transl., Mir, Moscow 1965.
42. P. M. Gruber and C. G. Lekkerkerker, Geometry of numbers, North-Holland, Amsterdam 1987.
43. J. H. Conway and N. J. A. Sloane, Sphere packings, lattices and groups, Springer-Verlag, New York 1988; Russian transl., Mir, Moscow 1990.
44. K. Rogers, Packing and covering, Cambridge Univ. Press, Cambridge 1964; Russian transl., Mir, Moscow 1968.