Prosanov, Roman 2018-11-01 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. application/pdf https://folia.unifr.ch/global/documents/307278 https://folia.unifr.ch/documents/307278/files/pro_cns.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.disc.2018.07.014 info:eu-repo/semantics/openAccess License undefined Discrete Mathematics. - 2018, vol. 341, no. 11, p. 3123–3133 info:eu-repo/classification/udc/51 Chromatic numbers of spheres http://purl.org/coar/resource_type/c_6501