Axiom of choice and chromatic number: Examples on the plane

Journal of Combinatorial Theory. Series A

Volumn 105, Issue 2, 2004, Pages 359-364

  Soifer, Alexander ^a,b,c   Shelah, Saharon ^b,d  

^a PRINCETON UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c UNIVERSITY OF COLORADO   (United States)

^d HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Axiom of choice; Axiomatic set theory; Chromatic number; Erd s problems and related topics to discrete geometry; Euclidean Ramsey theory; Graph theory

Indexed keywords

EID: 1942509707     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcta.2004.01.001     Document Type: Article

References (12)

1. P. Bernays, A system of axiomatic set theory III, J. Symbolic Logic 7 (1942) 65-89.
2. P. Erdös, N.G. de Bruijn, A colour problem for infinite graphs and a problem in the theory of relations, Indag. Math. 13 (1951) 371-373.
3. H.T. Croft, K.J. Falconer, R.K. Guy, Unsolved Problems in Geometry, Springer, New York, 1991.
4. V. Klee, S. Wagon, Old and New Unsolved Problems in Plane Geometry and Number Theory, The Mathematical Association of America, 1991.
5. T.J. Jech, The Axiom of Choice, North-Holland, Amsterdam, 1973.
6. S. Shelah, A. Soifer, Axiom of choice and chromatic number of the plane, J. Combin. Theory. Ser. A 103 (2) (2003) 391-397.
7. A. Soifer, Chromatic number of the plane & its relatives, Part I: the problem & its history, Geombinatorics XII (3) (2003) 131-148.
8. A. Soifer, Chromatic number of the plane & its relatives, Part II: results & further problems, Geombinatorics XII(4) (2003).
9. A. Soifer, Mathematical Coloring Book, CEME, Colorado Springs, CO (to appear).
10. R.M. Solovay, A model of set theory in which every set of reals is Lebesgue measurable, Ann. Math. 92 Ser. 2 (1970) 1-56.
11. R.M. Solovay, e-mail to A. Soifer of April 11, 2003.
12. E. Zermelo, Beweis dass jede Menge wohlgeordnet werden kann, Math. Ann. 59 (1904) 514-516.