Name
Abstract | ||
|---|---|---|
The chromatic number of the space is the minimum number of colors needed to color all points of the Euclidean space so that no two points of the same color are at unit distance. We show that this number is at least 6, improving the best-known previous bound of 5. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(00)00406-4 | Discrete Mathematics |
Keywords | Field | DocType |
chromatic number,space chromatic number,minimum number,unit distance,euclidean space | Discrete mathematics,Monochromatic color,Combinatorics,Chromatic scale,Graph colouring,Euclidean space,Ramsey's theorem,Color difference,Euclidean distance matrix,Mathematics | Journal |
Volume | Issue | ISSN |
256 | 1-2 | Discrete Mathematics |
Citations | PageRank | References |
9 | 1.39 | 10 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oren Nechushtan | 1 | 61 | 4.52 |