## 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 -circular coloring we assign arcs of length one of a circle with a perimeter in such a way that points at distance one get disjoint arcs. In this paper we show the existence of -circular coloring for . It is the first result with -circular coloring of the plane with smaller than 7. We also show -circular coloring of the plane with in the case when we require disjoint arcs for points at distance belonging to the internal .

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

Konstanty Junosza-Szaniawski,

Faculty of Mathematics and Information Science,

Warsaw University of Technology, Poland

## 1 Introduction

We refer to the famous Nelson-Hadwiger problem and a well studied coloring model - circular coloring. The Nelson Hadwiger problem is the question for the chromatic number of the euclidean plane, which is the minimum number of colors required to color the plane in such a way that no two points at distance 1 from each other have the same color. The exact number is not known. We only know that at least 4 colors are needed [5] and 7 colors suffice [3]. For a comprehensive history of the Hadwiger-Nelson problem see a monograph [7].

An -circular coloring of a graph is a function such that for any edge of holds . Notice that an -circular coloring can be seen as an assignment of arcs of length 1 of a circle with perimeter to vertices of in such a way that adjacent vertices get disjoint arcs. The circular chromatic number of a graph is the number . Circular coloring was first introduced by Vince [8]. For a survey see paper by Zhu [9]. Circular coloring applies in scheduling theory, to minimize the average time of process, that are repeated many times. It is known ([8]) that the circular chromatic number does not exceed chromatic number, but is bigger than the chromatic number minus one, formally for any graph .

In this paper we consider the circular coloring of the plane. Precisely the circular coloring of infinite graph , with the set of all points in the plane as the vertex set and the set of all pairs of points at distance one as the set of edges. If we combine known bounds for the chromatic number of the graph with properties of the circular chromatic number we obtain . The lower bound can be improved by comparing with another interesting parameter - fractional chromatic number. To define it we need to define first -fold coloring of the plane. A function is a -fold coloring if it assigns a -element set of natural numbers to the vertices of a graph in such a way that adjacent vertices get disjoint sets. The fractional chromatic number of is defined by

It is known [9] that the fractional chromatic number does not exceed circular chromatic number. The best known lower bound for the fractional chromatic number of is and it can be found in the book of Scheinerman and Ullman [6]. This gives us a lower bound on the circular chromatic number of the plane. DeVos, Ebrahimi, Ghebleh, Goddyn, Mohar, Naserasr [1] improved this bound by showing that the chromatic number of the plane is at least 4. In this paper we give first non-trivial upper bound on the circular chromatic number of the plane.

Exoo considered more restricted coloring of the plane in [2]. He asked for the minimum number of colors to color the plane in such a way that any points in at distance belonging to a given interval get different colors. For the problem reduces to Nelson-Hadwiger problem. The fractional and the -fold Exoo type coloring was studied in [4]. The method of circular coloring of the plane presented in this paper can be adapted to Exoo type coloring of the plane.

## 2 Main results

Let us introduce some definitions and notation. For by we denote the euclidean distance. For and we define and . Notice that for function is the standard floor function . By we denote an infinite graph with the vertex set and the set of edges . Our main result is the first non trivial bound on the circular chromatic number of the plane in a sense defined in Nelson-Hadwiger problem i.e. on .

###### Theorem 1.

###### Proof.

We not only give the bound on the circular chromatic number but actually present the -circular coloring of the plane. Let and let .

Let us start with some intuition on the construction a -circular coloring of the plane. Let denote a rectangle . We define -circular coloring of the rectangle by , (where ). Then we extend this coloring in a circular way on a strip . We simply join copies of the rectangle by their vertical sides so they form a strip . Each copy of is colored in the same way as the original rectangle . Then we take copies of the strip and join them with horizontal sides. Each strip is colored in the same way, but we shift each copy of by to the right comparing with the strip below (see Figures 1-2).

Formally the -circular coloring of the graph is defined by:

To prove that is a circular coloring of we show that for any pair of points and at distance 1 the the condition is fulfilled. Without loss of generality we assume that i.e . Let and . Notice that .

Moreover using fact that fact that and for we obtain:

Therefore without loss of generality we may assume that and . Recall that .

It remains to prove that . Consider following cases:

Case 1: . In this case and

Case 2: . In this case and

Case 3: . In this case and

Case 4: . In this case and

Case 5: . In this case and

Case 6: . In this case and

∎

The method of circular coloring defined in Theorem 1 can be also used to color in a circular way graphs . For small values of the number is strictly smaller than the known bound on the classic chromatic number of .

###### Theorem 2.

For holds

###### Proof.

The proof is analogous to the prove of Theorem 1. We partition the plane into copies of a rectangle, and color each copy in the same way. The difference is the size of rectangle and the factor in the coloring function. Let , . To prove the Theorem we define a -circular coloring of the by :

To make formulas shorter let . Then and

To prove that is a circular coloring of we show that for any pair of points and at distance in the condition holds. Without loss of generality we assume that i.e

Let and . Notice that .

Moreover, similarly as in the proof above, one can prove . Therefore without loss of generality we may assume that and .

Recall that . It remains to prove that . Consider following cases:

Case 1: . In this case and

Case 2: . In this case and

Case 3: . In this case and

Case 4: . In this case and

Case 5: . In this case and

Case 6: . In this case and

∎

### References

- M. DeVos, J. Ebrahimi, M. Ghebleh, L. Goddyn, B. Mohar, R. Naserasr, Circular Coloring the Plane, SIAM Journal on Discrete Mathematics, 21, 2 (April 2007), 461-465.
- G. Exoo, -Unit Distance Graphs, Discrete Comput. Geom, 33: 117-123, 2005.
- H. Hadwiger, Ungeloste Probleme, Elemente der Mathematik, 16: 103-104, 1961.
- J.Grytczuk, K.Junosza-Szaniawski, J.Sokół, K.Węsek, Fractional and -fold coloring of the plane, to appear.
- L. Moser, W. Moser, Problems for Solution, Canadian Bulletin of Mathematics, 4: 187-189, 1961.
- E.R. Scheinerman, D.H. Ullman, Fractional Graph Theory, John Wiley and Sons, 2008
- A. Soifer, The Mathematical Coloring Book, Springer, 2008.
- A. Vince. Star chromatic number. J. Graph Theory 12 (1988) 551-559
- X. Zhu, Circular chromatic number: a survey. Discrete Mathematics 229 (2001), 371-410.