Axiom of choice and chromatic number of the plane

Journal of Combinatorial Theory. Series A

Volumn 103, Issue 2, 2003, Pages 387-391

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

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b RUTGERS UNIVERSITY   (United States)

^c PRINCETON UNIVERSITY   (United States)

^d UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042853662     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-3165(03)00102-X     Document Type: Article

References (11)

1. P. Bernays, A system of axiomatic set theory III, J. Symbolic Logic 7 (1942) 65-89.
2. H.T. Croft, K.J. Falconer, R.K. Guy, Unsolved Problems in Geometry, Springer, New York, 1991.
3. P. Erdos, N.G. de Bruijn, A colour problem for infinite graphs and a problem in the theory of relations, Indag. Math. 13 (1951) 371-373.
4. n, Comm. Theory (A) 31 (1981) 187-189.
5. T.J. Jech, The Axiom of Choice, North-Holland, Amsterdam, 1973.
6. V. Klee, S. Wagon, Old and new Unsolved Problems in Plane Geometry and Number Theory, The Mathematical Association of America, Washington DC, 1991.
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: polychromatic number & 6-coloring, Geombinatorics XII (4) (2003) 191-216.
9. A. Soifer, Mathematical coloring book, CEME, Colorado Springs, to appear.
10. R.M. Solovay, A model of set theory in which every set of reals is Lebesgue measurable, Ann. of Math. (Ser. 2) 92 (1970) 1-56.
11. E. Zermelo, Reweis dass jede Menge wohlgeordnet warden kann, Math. Ann. 59 (1904) 514-516.