Chromatic numbers of spheres
Roman Prosanov
TL;DR
This paper establishes new upper bounds for the chromatic number of spheres in Euclidean space, advancing understanding of how to color points so that points at a fixed distance are differently colored.
Contribution
It provides novel upper bounds for the chromatic numbers of spheres, improving upon previous estimates in geometric graph theory.
Findings
New upper bounds for chromatic numbers of spheres
Enhanced understanding of coloring constraints on spherical surfaces
Progress in geometric coloring problems
Abstract
The chromatic number of a subset of Euclidean space is the minimal number of colors sufficient for coloring all points of this subset in such a way that any two points at the distance 1 have different colors. We give new upper bounds for chromatic numbers of spheres.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.