电邮这篇文章 On the chromatic numbers of low-dimensional spaces
- 作者: Cherkashin D.1,2,3, Raigorodskii A.2,4,5
-
隶属关系:
- St. Petersburg State University
- Moscow Institute of Physics and Technology (State University)
- Université de Genève
- Faculty of Mechanics and Mathematics
- Institute of Mathematics and Informatics
- 期: 卷 95, 编号 1 (2017)
- 页面: 5-6
- 栏目: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/224684
- DOI: https://doi.org/10.1134/S106456241701001X
- ID: 224684
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
New lower bounds are found for the minimum number of colors needed to color all points of a Euclidean space in such a way that any two points at a distance of 1 have different colors.
作者简介
D. Cherkashin
St. Petersburg State University; Moscow Institute of Physics and Technology (State University); Université de Genève
Email: mraigor@yandex.ru
俄罗斯联邦, St. Petersburg; Dolgoprudnyi, Moscow oblast, 141700; Genève
A. Raigorodskii
Moscow Institute of Physics and Technology (State University); Faculty of Mechanics and Mathematics; Institute of Mathematics and Informatics
编辑信件的主要联系方式.
Email: mraigor@yandex.ru
俄罗斯联邦, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119992; Buryat Republic, 670000
