The fractional chromatic number of the plane

DOI10.1007/S00493-016-3380-3MaRDI QIDQ722307zbMATHOpenAlexDBLPWikidataFDO

Authors Daniel W. Cranston, Landon Rabern

Publication date 23 July 2018

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.01647

zbMATH Keywords

fractional chromatic number

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Abstract: 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 $chi(mathcal{R}^2)$. The problem was introduced in 1950, and shortly thereafter it was proved that $4lechi(mathcal{R}^2)le7$. These bounds are both easy to prove, but after more than 60 years they are still the best known. In this paper, we investigate $ch{i}_f(mathcal{R}^2)$, the fractional chromatic number of the plane. The previous best bounds (rounded to five decimal places) were $3.5556lech{i}_f(mathcal{R}^2)le4.3599$. Here we improve the lower bound to $76/21approx3.6190$.

Recommendations

• On the chromatic number of subsets of the Euclidean plane
• scientific article; zbMATH DE number 865987
• The fractional chromatic number of infinite graphs
• Fractional and \(j\)-fold coloring of the plane
• scientific article; zbMATH DE number 2068164

Cites work

• A Variational Problem Pertaining to Biharmonic Maps
• A model of set-theory in which every set of reals is Lebesgue measurable
• Additive \(k\)-colorable extensions of the rational plane
• All unit-distance graphs of order 6197 are 6-colorable
• Distances realized by sets covering the plane
• Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
• Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
• The Mathematical Coloring Book
• The realization of distances in measurable subsets covering \(R^ n\).

Cited in

(13)

• Fractional chromatic number of uniform inflation graph, generalized circle and generalized wheel
• The chromatic number of the plane is at least 5
• Still Spinning: The Moser Spindle at Sixty
• Coloring distance graphs on the plane
• Special issue in honour of Landon Rabern
• Fractional and \(j\)-fold coloring of the plane
• On the density of sets of the Euclidean plane avoiding distance 1
• The density of planar sets avoiding unit distances
• The fractional chromatic number of infinite graphs
• The chromatic number of the plane is at least 5: a new proof
• scientific article; zbMATH DE number 865996 (Why is no real title available?)
• On upper bounds for the multi-fold chromatic numbers of the plane
• scientific article; zbMATH DE number 1341211 (Why is no real title available?)

This page was built for publication: The fractional chromatic number of the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722307)