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.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
H. Croft: Incidence Incidents, Eureka 30 (1967), 22–26.
N. G. de Bruijn and P. Erdős: A colour problem for infinite graphs and a problem in the theory of relations, Nederl. Akad. Wetensch. Proc. Ser. A. 54 = Indagationes Math. 13 (1951), 369–373.
P. Erdős: Unsolved problems, Congressus Numerantium XV–Proceedings of the 5th British Combinatorial Conference. 1975, 681, 1976.
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.
F. M. de Oliveira Filho and F. Vallentin: Fourier analysis, linear programming, and densities of distance avoiding sets in Rn, Journal of the European Mathematical Society, 12 (2010), 1417–1428.
K. Falconer: The realization of distances in measurable subsets covering Rn, Journal of Combinatorial Theory, Series A, 31 (1981), 184–189.
K. Fischer: Additive k-colorable extensions of the rational plane, Discrete Mathematics 82 (1990), 181–195.
D. Fisher and D. Ullman: The fractional chromatic number of the plane, Geombinatorics 2 (1992), 8–12.
M. Gardner: Mathematical games, Scientific American, 206:172–180, 10 1960.
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.
H. Hadwiger: Ueberdeckung des Euklidischen Raumes durch kongruente Mengen, Portugaliae Math. 4 (1945), 238–242.
R. Hochberg and P. O’Donnell: A large independent set in the unit distance graph, Geombinatorics 2 (1993), 83–84.
G. M. Levin: Selected Topics in Fractional Graph Theory, 1997, Thesis (Ph.D.)–The Johns Hopkins University.
S. L. Mahan: The fractional chromatic number of the plane, Master’s thesis, University of Colorado Denver, 1995.
B. Mohar: http://www.fmf.uni-lj.si/~mohar/Problems/P8UnitDistanceGraph.html.
L. Moser and W. Moser: Solution to problem 10, Can. Math. Bull. 4 (1961), 187–189.
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.
D. Pritikin: All unit-distance graphs of order 6197 are 6-colorable, Journal of Combinatorial Theory, Series B 73 (1998), 159–163.
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.
A. Soifer: The mathematical coloring book, Springer, New York, 2009, Mathematics of coloring and the colorful life of its creators, With forewords by Branko Grünbaum, Peter D. Johnson, Jr. and Cecil Rousseau.
R. Solovay: A model of set-theory in which every set of reals is Lebesgue measurable, Annals of Mathematics (1970), 1–56.
L. Székely: Measurable chromatic number of geometric graphs and sets without some distances in euclidean space, Combinatorica 4 (1984), 213–218.
D. Woodall: Distances realized by sets covering the plane, Journal of Combinatorial Theory, Series A 14 (1973), 187–200.
About this article
Cite this article
Cranston, D.W., Rabern, L. The fractional chromatic number of the plane. Combinatorica 37, 837–861 (2017). https://doi.org/10.1007/s00493-016-3380-3
Mathematics Subject Classification (2000)