Note on the Chromatic Number of Minkowski Planes: The Regular Polygon Case

DOI10.1556/012.2023.01536arXiv2301.13695OpenAlexW4386487310MaRDI QIDQ6155587FDOQ6155587

Authors:

Publication date: 5 June 2023

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Abstract: The famous Hadwiger-Nelson problem asks for the minimum number of colors needed to color the points of the Euclidean plane so that no two points unit distance apart are assigned the same color. In this note we consider a variant of the problem in Minkowski metric planes, where the unit circle is a regular polygon of even and at most 22 vertices. We present a simple lattice-sublattice coloring scheme that uses 6 colors, proving that the chromatic number of the Minkowski planes above are at most 6. This result is new for regular polygons having more than 8 vertices.

Full work available at URL: https://arxiv.org/abs/2301.13695

Recommendations

• The chromatic number of the Minkowski plane -- the regular polygon case
• Unit-Distance Graphs in Minkowski metric spaces
• On the chromatic number of plane tilings
• The chromatic number of the plane: the bounded case
• On the chromatic number of subsets of the Euclidean plane

zbMATH Keywords

asymmetric Ramsey-type problemscolorings of normed planesHadwiger-Nelson problems

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Cited In (1)

• Monochromatic triangles in the max-norm plane

This page was built for publication: Note on the Chromatic Number of Minkowski Planes: The Regular Polygon Case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155587)