The chromatic number of the plane with an interval of forbidden distances is at least 7

arXiv2304.10163MaRDI QIDQ6509735FDOQ6509735

Authors: Vsevolod Aleksandrovich Voronov 

Abstract: The work is devoted to to one of the variations of the Hadwiger--Nelson problem on the chromatic number of the plane. In this formulation one needs to find for arbitrarily small $varepsilon$ the least possible number of colors needed to color the Euclidean plane in such a way that any two points, the distance between which belongs to the interval $[1-varepsilon,1+varepsilon]$, are colored differently. The hypothesis proposed by G. Exoo in 2004, states that for arbitrary positive $varepsilon$ at least 7 colors are required. Also, with a sufficiently small $varepsilon$ the number of colors is exactly 7. The main result of this paper is the proof of this hypothesis.

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

This page was built for publication: The chromatic number of the plane with an interval of forbidden distances is at least 7

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509735)