On the chromatic numbers of low-dimensional spaces

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.

Saved in:
Bibliographic Details
Published in:Doklady. Mathematics 2017, Vol.95 (1), p.5-6
Main Authors: Cherkashin, D. D., Raigorodskii, A. M.
Format: Article
Language:English
Subjects:
Euclidean geometry
Euclidean space
Lower bounds
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1064-5624
1531-8362
DOI:10.1134/S106456241701001X