The chromatic number of the Minkowski plane -- the regular polygon case
From MaRDI portal
Publication:5164114
zbMATH Open1477.05182arXiv2108.12861MaRDI QIDQ5164114
Author name not available (Why is that?)
Publication date: 9 November 2021
Abstract: The Hadwiger-Nelson problem asks for the minimum number of colors, so that each point of the plane can be assigned a single color with the property that no two points unit-distance apart are identically colored. It is now known that the answer is , , or , Here we consider the problem in the context of Minkowski planes, where the unit circle is a regular polygon with , , or vertices. We prove that in each of these cases, one also needs at least five colors.
Full work available at URL: https://arxiv.org/abs/2108.12861
No records found.
This page was built for publication: The chromatic number of the Minkowski plane -- the regular polygon case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164114)