On Borsuk's Problem in ℝ 3

Mathematical Notes

Volumn 74, Issue 1-2, 2003, Pages 144-146

  Raigorodskii, A M ^a   Kalnishkan, Yu A ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

net; Borsuk's partitioning problem; Reuleaux polyhedron; Universal covering system (UCS)

Indexed keywords

EID: 0345863628     PISSN: 00014346     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025039721251     Document Type: Article

References (12)

1. K. Borsuk, Fund. Math., 20 (1933), 177-190.
2. A. M. Raigorodskii, Uspekhi Mat. Nauk [Russian Math. Surveys], 56 (2001), no. 1, 107-146.
3. J. Perkal, Colloq. Math., 1 (1947), 45.
4. H. G. Eggleston, J. London Math. Soc., 30 (1955), 11-24.
5. P. Katzarowa-Karanowa, Arch. Math., 18 (1967).
6. A. Heppes, Magyar Tud. Akad. Mat. Fiz. Oszt. Kozl., 7 (1957), 413-416.
7. B. Grünbaum, Proc. Cambridge Philos. Soc., 53 (1957), 776-778.
8. V. V. Makeev, Zap. Nauchn. Sem. S.-Peterburg. Otdel Mat. Inst. Steklov. (POMI) [J. Math. Sci.], (1997), no. 246.
9. D. Gale, Proc. Amer. Math. Soc., 4 (1953), 222-225.
10. V. G. Boltyanskii and I. Ts. Gokhberg, Theorems and Problems of Combinatorial Geometry [in Russian], Nauka, Moscow, 1965.
11. H. W. E. Jung, J. Reine Angew. Math., 123 (1901), 241-257.
12. F. Reuleaux, Lehrbuch der Kinematik I, F. Vieweg, Braunschweig, 1875.