Abstract
We consider the coloring of certain distance graphs on the Euclidean plane. Namely, we ask for the minimal number of colors needed to color all points of the plane in such a way that pairs of points at distance in the interval [1,b] get different colors. The classic Hadwiger–Nelson problem is a special case of this question — obtained by taking b=1. The main results of the paper are improved lower and upper bounds on the number of colors for some values of b. In particular, we determine the minimal number of colors for two ranges of values of b — one of which is enlarging an interval presented by Exoo and the second is completely new. Up to our knowledge, these are the only known families of distance graphs on R2 with a determined nontrivial finite chromatic number. Moreover, we present the first 8-coloring for b larger than values of b for the known 7-colorings. As a byproduct, we give some bounds and exact values for bounded parts of the plane, specifically by coloring certain annuli.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
