Around Borsuk's hypothesis

Journal of Mathematical Sciences

Volumn 154, Issue 4, 2008, Pages 604-623

  Raigorodskii, A M ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 54849423868     PISSN: 10723374     EISSN: 15738795     Source Type: Journal    
DOI: 10.1007/s10958-008-9196-y     Document Type: Article

References (123)

1. V. G. Boltyanskii 1960 The problem on illuminating the boundary of a convex body Izv. Mold. Filiala AN SSSR 76 10 77 84
2. V. G. Boltyanskii and I. Ts. Gokhberg, Theorems and Problems of Combinatorial Geometry [in Russian], Nauka, Moscow (1965).
3. E. D. Gluskin 1988 Extremal properties of orthogonal parallelepipeds and their application to the geometry of Banach spaces Mat. Sb. 136 1 85 96
4. L. Danzer, B. Grünbaum, and V. Clee, Helly's Theorem [Russian transl.], Mir, Moscow (1968).
5. R. Diestel', Theory of Graphs [in Russian], Izd. Inst. Mat., Novosibirsk (2002).
6. G. A. Kabatyanskii V. I. Levenshtein 1978 Estimates for Packings on a Sphere and in a Space Probl. Pered. Inform. 14 1 17
7. A. B. Katok and B. Khassel'blat, Introduction to the Modern Theory of Dynamical Systems [in Russsian], Faktorial, Moscow (1999).
8. G. Conway and N. Slohen, Packings of Balls, a Lattice and a Group [Russian transl.], Mir, Moscow (1990).
9. I. P. Kornfel'd, Ya. G. Sinai, and S. V. Fomin, Ergodic Theory [in Russian], Nauka, Moscow (1980).
10. N. N. Kuzyurin, "An asymptotic study of the covering problem," Probl. Kibern., No. 37, 19-56 (1980).
11. V. K. Leont'ev 1974 Upper estimates of the α-depth of (0, 1)-matrices Mat. Zam. 15 3 421 429
12. L. A. Lyusternik and L. G. Shnirel'man, Topological Methods in Variational Problems [in Russian], Moscow (1930).
13. V. V. Makeev, "Universal covers and projections of bodies of constant width," Ukr. Geom. Sb., bf32, 84-88 (1989).
14. V. V. Makeev 1996 Affine-inscribed and affine-circumscribed polygons and polyhedra Zap. Nauchn. Sem. POMI 231 286 298
15. V. V. Makeev 1997 On affine images of a rhombododecahedron circumscribed around a three-dimensional convex body Zap. Nauchn. Sem. POMI 246 191 195
16. E. I. Nechiporuk, "On topological principles of self-correction, " Probl. Kibern., No. 21, 5-103 (1969).
17. A. M. Raigorodskii 1997 On dimension in Borsuk's problem Usp. Mat. Nauk 52 6 181 182
18. A. M. Raigorodskii 1999 On one estimate in Borsuk's problem Usp. Mat. Nauk 54 2 185 186
19. A. M. Raigorodskii 1999 Systems of general representatives Fund. Prikl. Mat. 5 3 851 860
20. A. M. Raigorodskii 2000 On a chromatic number of a space Usp. Mat. Nauk 55 2 147 148
21. A. M. Raigorodskii 2002 Borsuk's problem for (0, 1)-polyhedra and cross-polytopes Dokl. Ross. Akad. Nauk 371 600 603
22. A. M. Raigorodskii 2001 Borsuk's problem and chromatic numbers of certain metric spaces Usp. Mat. Nauk 56 1 107 146
23. A. M. Raigorodskii 2002 Borsuk's problem for (0, 1)-polyhedra and cross-polytopes Dokl. Ross. Akad. Nauk 384 593 597
24. A. M. Raigorodskii 2002 On one problem of an optimal covering of sets by balls Chebyshev. Sb. 3 24 100 106
25. A. M. Raigorodskii 2002 Borsuk's and Hadwiger's problems and systems of vectors with bans on inner products Usp. Mat. Nauk 57 3 159 160
26. A. M. Raigorodskii 2002 Borsuk's problem for integer polyhedra Mat. Sb. 193 10 139 160
27. A. M. Raigorodskii 2003 On lower estimates for Borsuk's and Hadwiger's numbers Usp. Mat. Nauk 59 3 177 178
28. A. M. Raigorodskii 2003 Borsuk's, Grünbaum, and Hadwiger's problems for certain classes of polyhedra and graphs Dokl. Ross. Akad. Nauk 388 6 738 742
29. A. M. Raigorodskii 2003 The Erdös-Hadwiger problem and chromatic numbers of finite geometric graphs Dokl. Ross. Akad. Nauk 392 3 313 317
30. A. M. Raigorodskii 2004 Borsuk's and Grünbaum problems for lattice polyhedra Izv. Ross. Akad. Nauk 69 3 96 121
31. q Usp. Mat. Nauk 59 5 161 162
32. A. M. Raigorodskii 2004 On chromatic numbers of metric spaces Chebyshev. Sb. 5 19 175 185
33. A. M. Raigorodskii, "On relationship between the Borsuk and Nelson-Erdös-Hadwiger problems," Usp. Mat. Nauk, 60 (2005)
34. A. M. Raigorodskii, "The Erdös-Hadwiger problem and chromatic numbers of finite geometric graphs," Mat. Sb., 196, No. 1 (2005).
35. A. M. Raigorodskii, "Chromatic numbers of metric spaces," in: Proc. Inst. Math. of the National Academy of Sciences, Belarus (2005).
36. A. M. Raigorodskii, "On Borsuk and Erdös-Hadwiger's numbers," Mat. Zametki (2005).
37. 3 Mat. Zametki 74 1 149 151
38. A. M. Raigorodskii A. A. Chernov 2004 Borsuk's problem for certain classes of polyhedra Chebyshev. Sb. 5 210 98 103
39. A. S. Riesling 1971 Borsuk's problem in three-dimensional spaces of constant curvature Ukr. Geom. Sb. 11 78 83
40. K. Rogers, Packings and Coverings [Russian transl.], Mir, Noscow (1968).
41. A. A. Sapozhenko, "On complexity of disjunctive normal forms obtained by using the gradient algorithm," Diskr. Anal., Novosibirsk, No. 21, 62-71 (1972).
42. V. E. Tarakanov, Combinatorial Problems and (0, 1)-Matrices [in Russian], Nauka, Moscow (1985).
43. H. Hadwiger and H. Debrunner, Combinatorial Geometry of a Plane [Russian transl.], Nauka, Moscow (1965).
44. F. Harari, Theory of Graphs [Russian transl.], Mir, Moscow (1973).
45. R. Ahlswede L. H. Khachatrian 1997 The complete nontrivial-intersection theorem for systems of finite sets J. Combin. Theor. Ser. A 76 121 138
46. R. Ahlswede L. H. Khachatrian 1997 The complete intersection theorem for systems of finite sets Eur. J. Combin. 18 125 136
47. M. Aigner and G. M. Ziegler, Proofs from THE BOOK, Springer-Verlag Berlin (1998).
48. N. Alon L. Babai H. Suzuki 1991 Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems J. Combin. Theor. Ser. A 58 165 180
49. N. Alon and J. Spencer, The Probabilistic Method, Wiley-Interscience Ser. in Discr. Math. and Optimization (2000).
50. L. Babai and P. Frankl, Linear Algebra Methods in Combinatorics, Part 1, Department of Computer Science, The University of Chicago, Preliminary version 2, September 1992.
51. M. Benda M. Perles 2000 Colorings of metric space Geombinatorics 9 113 126
52. B. Bollobás 1988 The chromatic number of random graphs Combinatorica 8 49 56
53. B. Bollobás, Random Graphs, Cambridge Univ. Press, Second Edition (2001).
54. V. G. Boltyanski, H. Martini and P. S. Soltan, Excursions into Combinatorial Geometry, Berlin-Heidelberg: Universitext, Springer-Verlag (1997).
55. K. Borsuk 1932 Über die Zerlegung einer Euklidischen n-dimensionalen Vollkugel in n Mengen Verh. Internat Math. Kongr., Zürich 2 192
56. K. Borsuk 1933 Drei Sätze über die n-dimensionale euklidische Sphäre Fundam. Math. 20 177 190
57. d by balls of the same diameter," in: Geometric Aspects of Functional Analysis (J. Lindenstrauss and V. Milman, eds.), Lecture Notes in Math., 1469, Berlin: Springer-Verlag (1991), pp. 138-144.
58. d and a problem of Grünbaum," Proc. Colloquium on Convexity, Copenhagen, (1965), p. 41.
59. N. G. de Bruijn P. Erdös 1951 A colour problem for infinite graphs and a problem in the theory of relations Proc. Koninkl. Nederl. Acad. Wet., Ser. A 54 5 371 373
60. M. Deza P. Erdös P. Frankl 1978 Intersection properties of systems of finite sets Proc. London Math. Soc. 36 369 384
61. M. Deza P. Erdös N. M. Singhi 1978 Combinatorial problems on subsets and their intersections Adv. Math., Suppl. Stud. 1 259 265
62. M. Deza P. Frankl 1983 Erdös-Ko-Rado theorem: 22 years later SIAM J. Alg. Disc. Methods 4 419 431
63. H. G. Eggleston 1955 Covering a three-dimensional set with sets of smaller diameter J. London Math. Soc. 30 11 24
64. H. G. Eggleston, Convexity, Cambridge Univ. Press (1958).
65. P. Erdös 1946 On sets of distances of n points Am. Math. Mon. 53 248 250
66. P. Erdös, "My Scottish Book Problems," in: The Scottish Book, Mathematics from the Scottish Café (R. D. Mauldin ed.), Birkhäuser (1981), pp.35-43.
67. P. Erdös, Chao Ko and R. Rado, "Intersection theorems for systems of finite sets," J. Math. Oxford, 12(48) (1961).
68. P. Frankl 1978 The Erdös-Ko-Rado theorem is true for n = ckt Combinatorics, Coll. Math. Soc. J. Bolyai 18 365 375
69. P. Frankl 1980 Extremal problems and coverings of the space Eur. J. Combin. 1 101 106
70. P. Frankl R. M. Wilson 1981 Intersection theorems with geometric consequences Combinatorica 1 357 368
71. Z. Füredi, "Turán's type problems," in: Surveys in Combinatorics, Proc. of the 13th British Combinatorics Conference (A. D. Keedwell, ed.). Cambridge Univ. Press, London Math. Soc. Lecture Note Series, 166 (1991), pp. 253-300.
72. D. Gale 1953 On inscribing n-dimensional sets in a regular n-simplex Proc. Am. Math. Soc. 4 222 225
73. J. Grey und B. Weissbach, Ein weiteres Gegenbeispiel zur Borsukschen Vermutung, Univ. Magdeburg, Fakultät für Mathematik, Preprint 25 (1997).
74. P. M. Gruber and C. G. Lekkerkerker, Geometry of Numbers, North-Holland, Amsterdam (1987).
75. B. Grünbaum 1957 A simple proof of Borsuk's conjecture in three dimensions Proc. Cambridge Philos. Soc. 53 776 778
76. B. Grünbaum 1963 Borsuk's problem and related questions Proc. Symp. Pure Math. 7 271 284
77. H. Hadwiger 1945 Überdeckung einer Menge durch Mengen kleineren Durchmessers Commun. Math. Helv. 18 73 75
78. H. Hadwiger 1957 Ungelöste Probleme No. 20 Elem. Math. 12 121
79. H. Hadwiger 1960 Ungelöste Probleme No. 38 Elem. Math. 15 130 131
80. H. Hadwiger 1961 Ungelöste Probleme No. 40 Elem. Math. 16 103 104
81. H. C. Hansen 1992 Small universal covers for sets of unit diameter Geom. Dedicata 42 205 213
82. E. Helly 1930 Über Systeme abgeschlossener Mengen mit gemeinschaftlichen Punkten Monatsh. Math. 37 281 302
83. E. Helly, "On a collection of convex bodies with common points," Russ. Math. Surv., 2, No. 2 (1936).
84. A. Heppes 1957 Térbeli ponthalmazok felosztása kisebb átméröjü részhalmazok összegére A magyar tudományos akadémia 7 413 416
85. A. Heppes P. Révész 1956 Zum Borsukschen Zerteilungsproblem Acta Math. Acad. Sci. Hung. 7 159 162
86. A. Hinrichs 2002 Spherical codes and Borsuk's conjecture Discr. Math. 243 253 256
87. A. Hinrichs and Ch. Richter, "New sets with large Borsuk numbers," (2002) http://www.minet.uni-jena.de/hinrichs/paper/18/borsuk.pdf
88. H. W. E. Jung 1901 Über die kleinste Kugel, die eine räumliche Figur einschliesst J. Reine Angew. Math. 123 241 257
89. J. Kahn G. Kalai 1993 A counterexample to Borsuk's conjecture Bull. Am. Math. Soc. (New Ser.) 29 1 60 62
90. 1-norm Theor. Comput. Sci. 319 1-3 357 366
91. G. Katona T. Nemetz M. Simonovitz 1964 On a graph problem of Turan Mat. Lapok 15 228 238
92. P. Katzarowa-Karanowa 1967 Über ein euklidisch-geometrisches Problem von B. Grünbaum Arch. Math. 18 663 672
93. D. Larman, "Open problem 6. Convexity and Graph theory," (M. Rozenfeld and J. Zaks eds.), Ann. Discr. Math., 20, North-Holland, Amsterdam and New York (1984), p. 336.
94. D. G. Larman 1978 A note on the realization of distances within sets in Euclidean space Comment. Math. Helv. 53 529 535
95. D. G. Larman C. A. Rogers 1972 The realization of distances within sets in Euclidean space Mathematika 19 1 24
96. M. Lassak 1982 An estimate concerning Borsuk's partition problem Bull. Acad. Pol. Sci. Ser. Math. 30 449 451
97. H. Lenz 1955 Zur Zerlegung von Punktmengen in solche kleineren Durchmessers Arch. Math. 6 5 413 416
98. H. Lenz 1956 Über die Bedeckung ebener Punktmengen durch solche kleineren Durchmessers Arch. Math. 4 34 40
99. N. Linial R. Meshulam M. Tarsi 1988 Matroidal bijections between graphs J. Combin. Theor. Ser. B 45 1 31 44
100. H. Martini V. Soltan 1999 Combinatorial problems on the illumination of convex bodies Aequationes Math. 57 121 152
101. A. Nilli 1994 On Borsuk's problem Contemp. Math. 178 209 210
102. J. Pál, "Über ein elementares Variationsproblem," Danske Videnskab. Selskab., Math.-Fys. Meddel, 3, No. 2 (1920).
103. C. Payan 1992 On the chromatic number of cube like graphs Discr. Math. 103 271 277
104. J. Petersen, Färbung von Borsuk-Graphen in niedriger Dimension, Diplomarbeit, TU Berlin (1998).
105. O. Pikhurko, "Borsuk's conjecture fails in dimensions 321 and 322," e-print: arXiv: math.CO/0202112, 2002.
106. A. M. Raigorodskii 2004 The Borsuk partition problem: the seventieth anniversary Mathematical Intelligencer 26 4 4 12
107. R. Rankin 1947 On the closest packing of spheres in n dimensions Ann. Math. 48 1062 1081
108. D. K. Ray-Chaudhuri R. M. Wilson 1975 On t-designs Osaka J. Math. 12 735 744
109. F. Reuleaux, Lehrbuch der Kinematik I. Vieweg, Braunschweig (1875).
110. C. A. Rogers 1963 Covering a sphere with spheres Mathematika 10 157 164
111. C. A. Rogers 1971 Symmetrical sets of constant width and their partitions Mathematika 18 105 111
112. C. A. Rogers, "Some problems in the geometry of convex bodies. The Geometric Vein," in: The Coxeter Festschrift (C. Davis, B. Grünbaum, and F. A. Sherk, eds.), Springer-Verlag, New York (1981), pp. 279-284.
113. F. Schiller, Zur Berechnung und Abschätzung von Färbungszahlen und der v-Funktion von Graphen, Diplomarbeit, TU Berlin (1999).
114. J. Schopp, "Die Abdeckung ebener Bereiche mit konstanten Durchmessern durch drei Kreise von kleinerem Durchmesser," Vortrag, gehalten auf der Geometrie-Tegen in Tihany (Ungarn) (1965).
115. O. Schramm 1988 Illuminating sets of constant width Mathematika 35 180 189
116. A. Soifer, "Chromatic number of the plane: a historical essay," Geombinatorics, 13-15 (1991).
117. A. Soifer, Mathematical Coloring Book, Center for Excellence in Mathematical Education (1997).
118. P. Turán 1941 Egy grafelmeletiszelsoertek feladatrol Mat. Fiz. Lapok 48 436 452
119. B. Weissbach, "Polyhedral covers," Collect. Math. Soc. J. Bolyai, 48 (Intuitive Geometry), North-Holland, Amsterdam et al. (1987), pp. 639-646.
120. B. Weissbach 2000 Sets with large Borsuk number Beitr. Alg. Geom. 41 417 423
121. R. M. Wilson 1984 The exact bound in the Erdös-Ko-Rado theorem Combinatorica 4 247 257
122. G. M. Ziegler, "Lectures on 0/1-polytopes," in: Polytopes-Combinatorics and Computation (G. Kalai and G. M. Ziegler, eds.), DMV, seminar 29, Birkhäuser, Basel (2000), pp. 1-44.
123. G. M. Ziegler 2001 Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions Lect. Notes Comput. Sci. 2122 159 171