The chromatic number of the plane is at least 5
From MaRDI portal
Publication:4556186
Abstract: We present a family of finite unit-distance graphs in the plane that are not 4-colourable, thereby improving the lower bound of the Hadwiger-Nelson problem. The smallest such graph that we have so far discovered has 1581 vertices.
Recommendations
- scientific article; zbMATH DE number 2042230
- scientific article; zbMATH DE number 866016
- The chromatic number of the plane is at least 5: a new proof
- The chromatic number of the plane: the bounded case
- scientific article; zbMATH DE number 1552837
- The fractional chromatic number of the plane
- scientific article; zbMATH DE number 865996
- scientific article; zbMATH DE number 2068164
- The chromatic number of the taxicab plane
- The chromatic number of the plane is at least 5 -- a human-veriviable proof
Cited in
(83)- Triangle colorings require at least seven colors
- Density estimates of 1-avoiding sets via higher order correlations
- On rainbow isosceles \(n\)-simplexes
- Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\)
- The geometry and combinatorics of discrete line segment hypergraphs
- The chromatic number of the plane is at least 5: a new proof
- On a Frankl-Wilson theorem
- On the chromatic numbers corresponding to exponentially Ramsey sets
- A universal partition result for infinite homogeneous K_n-free and related graphs
- The Namer-Claimer game
- Polynomial configurations in sets of positive upper density over local fields
- Exponentially Ramsey sets
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Lower bounds for the measurable chromatic number of the hyperbolic plane
- Counterexamples to Borsuk's conjecture with large girth
- Exact square coloring of subcubic planar graphs
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
- Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions
- Clique numbers of finite unit-quadrance graphs
- Odd wheels are not odd-distance graphs
- First non-trivial upper bound on circular chromatic number of the plane
- 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?)
- 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 \(\mathbb R^4\)
- scientific article; zbMATH DE number 866009 (Why is no real title available?)
- All finite sets are Ramsey in the maximum norm
- Odd Wheels Are Not Odd-distance Graphs
- On the Babai and upper chromatic numbers of graphs of diameter 2
- On the density of sets of the Euclidean plane avoiding distance 1
- A recursive Lovász theta number for simplex-avoiding sets
- A finite graph approach to the probabilistic Hadwiger-Nelson problem
- A small 6-chromatic two-distance graph in the plane
- Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane
- Monochromatic equilateral triangles in the unit distance graph
- The chromatic number of the Minkowski plane -- the regular polygon case
- Avoiding Multiple Repetitions in Euclidean Spaces
- Discrete approximation of coloring the plane
- Zero sums on unit square vertex sets and plane colorings
- Still Spinning: The Moser Spindle at Sixty
- Coloring distance graphs on the plane
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
- Almost-monochromatic sets and the chromatic number of the plane
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023
- Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions
- Chromatic coloring of distance graphs, III
- On the chromatic number of 2-dimensional spheres
- Chromatic numbers of Cayley graphs of abelian groups: a matrix method
- Odd distances in colourings of the plane
- Max-norm Ramsey theory
- On the chromatic number of slices without monochromatic unit arithmetic progressions
- Annulus graphs in \(\mathbb{R}^d\)
- Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
- Maximum likelihood thresholds via graph rigidity
- The density of planar sets avoiding unit distances
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- Chromatic coloring of distance graphs \(\mathrm{V}\)
- Assorted musings on dimension-critical graphs
- On the Chromatic Number of the Plane with Two Forbidden Distances
- Canonical theorems in geometric Ramsey theory
- Cliques in representation graphs of quadratic forms
- Cutting corners
- A lower bound on the number of colours needed to nicely colour a sphere
- Spherical sets avoiding orthonormal bases
- Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)
- Monochromatic infinite sets in Minkowski planes
- Fractional Chromatic Numbers and Chromatic Numbers for the Fibonacci Distance Graphs
- Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs
- A Graph Theorist Plants a Tree
- Nonrepetitive colorings of \(\mathbb{R}^d\) (extended abstract)
- Chromatic number of spacetime
- Coloring unit-distance strips using SAT
- Unit and distinct distances in typical norms
- Uniquely optimal codes of low complexity are symmetric
- 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
- A solution to Ringel's circle problem
This page was built for publication: The chromatic number of the plane is at least 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556186)
