The chromatic number of the plane is at least 5: a new proof
From MaRDI portal
Publication:2189746
Abstract: We present an alternate proof of the fact that given any 4-coloring of the plane there exist two points unit distance apart which are identically colored.
\textit{A. D. N. J. de Grey} [Geombinatorics 28, No. 1, 18--31 (2018; Zbl 1404.05063)] used a graph with 1581 vertices to show that the chromatic number of the plane is at least five. The lower bound, as exhibited by the Moser spindle, had been at four since 1961 [\textit{L. Moser} and \textit{W. Moser}, ``Solution to problem 10, Can. Math. Bull. 4, 187--189 (1961)]. The present paper uses a graph with 627 vertices to achieve the same lower bound of five.
Recommendations
- The chromatic number of the plane is at least 5
- The chromatic number of the plane is at least 5 -- a human-veriviable proof
- The vector graph and the chromatic number of the plane, or how not to prove that \(\chi(\mathbb E^2)>4\)
- A small 6-chromatic two-distance graph in the plane
- On the chromatic number of plane tilings
Cites work
- Computing small unit-distance graphs with chromatic number 5
- scientific article; zbMATH DE number 6708269 (Why is no real title available?)
- scientific article; zbMATH DE number 3098609 (Why is no real title available?)
- The chromatic number of the plane is at least 5
- The fractional chromatic number of the plane
- The Mathematical Coloring Book
Cited in
(41)- Triangle colorings require at least seven colors
- Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\)
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
- A proof from The Book: a lower bound for the polychromatic number of the plane
- A proof from The Book: a lower bound for the polychromatic number of the plane
- Collected papers of Leo Moser. Edited by William Moser and Paulo Ribenboim
- The chromatic number of the plane is at least 5 -- a human-veriviable proof
- Finite -unit distance graphs
- scientific article; zbMATH DE number 2068164 (Why is no real title available?)
- The chromatic number of the plane is at least 5
- Computing small unit-distance graphs with chromatic number 5
- The Hadwiger-Nelson problem with two forbidden distances
- The vector graph and the chromatic number of the plane, or how not to prove that \(\chi(\mathbb E^2)>4\)
- On the chromatic number of circular disks and infinite strips in the plane
- All finite sets are Ramsey in the maximum norm
- A finite graph approach to the probabilistic Hadwiger-Nelson problem
- A 6-chromatic two-distance graph in the plane
- A small 6-chromatic two-distance graph in the plane
- What percent of the plane can be properly 5- and 6-colored?
- Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane
- Avoiding Multiple Repetitions in Euclidean Spaces
- Almost-monochromatic sets and the chromatic number of the plane
- Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions
- Decidability of modal logics of non-\(k\)-colorable graphs
- Max-norm Ramsey theory
- On the chromatic number of slices without monochromatic unit arithmetic progressions
- Annulus graphs in \(\mathbb{R}^d\)
- Monochromatic triangles in the max-norm plane
- The density of planar sets avoiding unit distances
- Canonical theorems in geometric Ramsey theory
- Cutting corners
- A lower bound on the number of colours needed to nicely colour a sphere
- Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)
- Monochromatic infinite sets in Minkowski planes
- Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
- Chromatic number of spacetime
- Unit and distinct distances in typical norms
- On chromatic numbers of 3-dimensional slices
- Prime and polynomial distances in colourings of the plane
- On the chromatic number of the plane for map-type colorings
- Proof of a conjectured lower bound on the chromatic number of a graph
This page was built for publication: The chromatic number of the plane is at least 5: a new proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189746)
