Odd distances in colourings of the plane

2022/09/30 by Davies, James · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)

paper · doi:10.48550/arxiv.2209.15598

Abstract

We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd distance from each other.

Cited by

• Ramsey problems for graphs in Euclidean spaces and Cartesian powers

Related

• Prime and polynomial distances in colourings of the plane
• The chromatic number of the plane is at least 5 - a new proof
• The chromatic number of the plane with an interval of forbidden distances is at least 7
• A 6-chromatic two-distance graph in the plane
• The chromatic number of the plane is at least 5