Chromatic numbers of metric spaces

Journal of Mathematical Sciences

Volumn 154, Issue 4, 2008, Pages 624-627

  Raigorodskii, A M ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 54849421308     PISSN: 10723374     EISSN: 15738795     Source Type: Journal    
DOI: 10.1007/s10958-008-9197-x     Document Type: Article

References (14)

1. A. M. Raigorodskii 2000 On the chromatic number of the space Usp. Mat. Nauk 55 2 147 148
2. A. M. Raigorodskii 2001 Borsuk problem and chromatic numbers of certain metric spaces Usp. Mat. Nauk 56 1 107 146
3. q Usp. Mat. Nauk 59 5 161 162
4. A. M. Raigorodskii 2004 On chromatic numbers of metric spaces Chebyshev. Sb. 5 19 175 185
5. A. M. Raigorodskii 2005 Erdös-Hadwiger problem and chromatic numbers of finite geometric graphs Mat. Sb. 196 1 123 156
6. P. Harari, Graph Theory [Russian translation], Mir, Moscow (1973).
7. M. Benda M. Perles 2000 Colorings of metric spaces Geombinatorics 9 113 126
8. 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
9. P. Frankl R. Wilson 1981 Intersection theorems with geometric consequences Combinatorica 1 357 368
10. H. Hadwiger 1961 Ungelöste Probleme No. 40 Elem. Math. 16 103 104
11. D. G. Larman C. A. Rogers 1972 The realization of distances within sets in Euclidean space Mathematika 19 1 24
12. A. Soifer, "Chromatic number of the plane: a historical essay," Geombinatorics, 13-15 (1991).
13. A. Soifer, Mathematical Coloring Book, Center for Excellence in Mathematical Education (1997).
14. L. A. Székely 2002 Erdös on unit distances and the Szemerédi-Trotter theorems J. Bolyai Math. Soc. 11 649 666