Small 5-chromatic unit-distance graphs in disks of radius 3/2, 5/4 and 23/20
math.CO
Submitted: 2026-11-04
Updated: 2026-11-04
Comments: 6 pages, 4 figures; ancillary files contain the graphs, 5-colourings and an exact verification script
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- The chromatic number of the plane is at least 5
- Computing Small Unit-Distance Graphs with Chromatic Number 5
- Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane
- The chromatic number of the plane is at least 5 -- a human-verifiable proof
- A small 6-chromatic two-distance graph in the plane
- What percent of the plane can be properly 5- and 6-colored?
- On upper bounds for the multi-fold chromatic numbers of the plane
- A 6-chromatic odd-distance graph in the plane
- On the plane and its coloring
- Tiling the plane with hexagons: improved separations for $k$-colourings
- On lower bounds of the order of $k$-chromatic unit distance graphs
- More certainty in coloring the plane with a forbidden distance interval
- The chromatic number of $\mathbb{R}^8$ is at least 25
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality