Note on the chromatic number of Minkowski planes: the regular polygon case. (English) Zbl 07692707
The author studies the chromatic number of the plane, when the distance is measured with respect to a norm induced by a \(0\)-symmetric regular polygon with at most 22 vertices. It is shown that in these cases the chromatic number is at most 6, improving on former results.
Reviewer: Martin Henk (Berlin)
MSC:
52C10 | Erdős problems and related topics of discrete geometry |