Computational geometry column 46

International Journal of Computational Geometry and Applications

Volumn 14, Issue 6, 2004, Pages 475-478

  O'Rourke, Joseph ^a  

^a SMITH COLLEGE   (United States)

Author keywords

Geometric Ramsey theory; Graph coloring

Indexed keywords

EID: 18744411500     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021819590400155X     Document Type: Article

References (6)

1. P. Erdo″s and N. G. de Bruijn, A colour problem for infinite graphs and a problem in the theory of relations, Indag. Math. 13 (1951) 371-373.
2. R. L. Graham, Euclidean Ramsey theory, August 2003, Lecture at Mathematical Sciences Research Institute, Berkeley, http://www.msri.org/publications/video/index07.html.
3. R. L. Graham, Euclidean Ramsey theory, in Handbook of Discrete and Computational Geometry, eds. J. E. Goodman and J. O'Rourke (CRC Press LLC, Boca Raton, FL, 2004), (Second Edition), chapter 11, pp. 239-254.
4. R. L. Graham, Open problems in Euclidean Ramsey theory, Geocombinatorics XIII(4) (2004) 165-177.
5. 2, J. Combinatorial Theory Series A 20 (1976) 385-389.
6. S. Shelah and A. Soifer, Axiom of choice and chromatic number of the plane, J. Combinatorial Theory Series A 103(2) (2003) 387-391.