Chromatic numbers of spheres
Combinatorics
2018-11-12 v2 Metric Geometry
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.
Cite
@article{arxiv.1711.03193,
title = {Chromatic numbers of spheres},
author = {Roman Prosanov},
journal= {arXiv preprint arXiv:1711.03193},
year = {2018}
}