First non-trivial upper bound on the circular chromatic number of the plane

preprint2015arXivOpen access

Abstract

We consider circular version of the famous Nelson-Hadwiger problem. It is know that 4 colors are necessary and 7 colors suffice to color the euclidean plane in such a way that points at distance one get different colors. In rr-circular coloring we assign arcs of length one of a circle with a perimeter rr in such a way that points at distance one get disjoint arcs. In this paper we show the existence of rr-circular coloring for r=4+433≈6.30r=4+\frac{4\sqrt{3}}{3}\approx 6.30. It is the first result with rr-circular coloring of the plane with rr smaller than 7. We also show rr-circular coloring of the plane with r<7r<7 in the case when we require disjoint arcs for points at distance belonging to the internal [1011,1211][\frac{10}{11}, \frac{12}{11}].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.