| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902832 | Discrete Mathematics | 2018 | 11 Pages |
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 on chromatic numbers of spheres. This also allows us to give new upper bounds on chromatic numbers of any bounded subsets.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roman Prosanov,