The fractional chromatic number of the plane

DOI10.1007/S00493-016-3380-3zbMATH Open1399.05069DBLPjournals/combinatorica/CranstonR17arXiv1501.01647OpenAlexW2964034252WikidataQ56001809 ScholiaQ56001809MaRDI QIDQ722307FDOQ722307

Authors: Daniel W. Cranston, Landon Rabern 

Publication date: 23 July 2018

Published in: Combinatorica (Search for Journal in Brave)

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$.

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

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

zbMATH Keywords

fractional chromatic number

Mathematics Subject Classification ID

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

Cites Work

• The realization of distances in measurable subsets covering \(R^ n\).
• A model of set-theory in which every set of reals is Lebesgue measurable
• The Mathematical Coloring Book
• 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
• A Variational Problem Pertaining to Biharmonic Maps
• Distances realized by sets covering the plane
• All unit-distance graphs of order 6197 are 6-colorable
• Additive \(k\)-colorable extensions of the rational plane

Cited In (11)

• Title not available (Why is that?)
• The fractional chromatic number of infinite graphs
• Title not available (Why is that?)
• Still Spinning: The Moser Spindle at Sixty
• The density of planar sets avoiding unit distances
• Fractional chromatic number of uniform inflation graph, generalized circle and generalized wheel
• The chromatic number of the plane is at least 5: a new proof
• Coloring distance graphs on the plane
• On the density of sets of the Euclidean plane avoiding distance 1
• Special issue in honour of Landon Rabern
• The chromatic number of the plane is at least 5

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)