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.
Original language | English |
---|---|
Pages (from-to) | 5-6 |
Number of pages | 2 |
Journal | Doklady Mathematics |
Volume | 95 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2017 |
ID: 36100756