首页 | 本学科首页   官方微博 | 高级检索  
     


Chromatic numbers of spheres
Authors:Roman Prosanov
Affiliation:Université de Fribourg, Chemin du Musée 23, CH-1700 Fribourg, Switzerland;Moscow Institute Of Physics And Technology, Institutskiy per. 9, 141700, Dolgoprudny, Russia
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:Chromatic number  Geometric covering
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号