Timeline for Chromatic number of unit distance graph of R^n
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 9 at 16:25 | comment | added | Timothy Chow | I would be surprised if this is known. For example, it is known that $\chi(\mathbb{R}^2) \le 7$ and $\chi(\mathbb{R}^3)\ge 6$, but I don't think any better bounds are known. That doesn't quite rule out the possibility that $\chi(\mathbb{R}^2 )< \chi(\mathbb{R}^3)$ could be known, but again, I would be surprised. See On the chromatic numbers of small-dimensional Euclidean spaces for some more info. | |
| Dec 7 at 1:39 | history | asked | Gumby | CC BY-SA 4.0 |