The fractional chromatic number of the plane
- 90 Downloads
The chromatic number of the plane is the chromatic number of the uncountably infinite graph that has as its vertices the points of the plane and has an edge between two points if their distance is 1. This chromatic number is denoted χ(ℝ2). The problem was introduced in 1950, and shortly thereafter it was proved that 4≤χ(ℝ2)χ≤7. These bounds are both easy to prove, but after more than 60 years they are still the best known. In this paper, we investigate χ f (ℝ2), the fractional chromatic number of the plane. The previous best bounds (rounded to five decimal places) were 3.5556≤χ f (ℝ2)≤4.3599. Here we improve the lower bound to 76/21≈3.6190.
Mathematics Subject Classification (2000)05C15
Unable to display preview. Download preview PDF.
- H. Croft: Incidence Incidents, Eureka 30 (1967), 22–26.Google Scholar
- P. Erdős: Unsolved problems, Congressus Numerantium XV–Proceedings of the 5th British Combinatorial Conference. 1975, 681, 1976.Google Scholar
- P. Erdős: Problems and results in combinatorial geometry, In Discrete geometry and convexity (New York, 1982), volume 440 of Ann. New York Acad. Sci., pages 1–11. New York Acad. Sci., New York, 1985.Google Scholar
- M. Gardner: Mathematical games, Scientific American, 206:172–180, 10 1960.Google Scholar
- J. Grytczuk, K. Junosza-Szaniawski, J. Sokół and K. Wesek: Fractional and j-fold colouring of the plane, Arxiv preprint: http://arxiv.org/abs/1506.01887.Google Scholar
- G. M. Levin: Selected Topics in Fractional Graph Theory, 1997, Thesis (Ph.D.)–The Johns Hopkins University.Google Scholar
- S. L. Mahan: The fractional chromatic number of the plane, Master’s thesis, University of Colorado Denver, 1995.Google Scholar
- B. Mohar: http://www.fmf.uni-lj.si/~mohar/Problems/P8UnitDistanceGraph.html.Google Scholar
- P. M. O’Donnell: High-girth unit-distance graphs, ProQuest LLC, Ann Arbor, MI, 1999, Thesis (Ph.D.)–Rutgers The State University of New Jersey-New Brunswick.Google Scholar
- E. R. Scheinerman and D. H. Ullman: Fractional Graph Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., New York, 1997, A rational approach to the theory of graphs, with a foreword by Claude Berge, A Wiley-Interscience Publication.zbMATHGoogle Scholar
- R. Solovay: A model of set-theory in which every set of reals is Lebesgue measurable, Annals of Mathematics (1970), 1–56.Google Scholar