  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.
