Chromatic numbers of spheres
classification
🧮 math.CO
math.MG
keywords
chromaticcolorsnumbernumberspointsspheressubsetbounds
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.