The chromatic number of $\mathbb{R}^8$ is at least 25
Jaan Parts

TL;DR
This paper establishes a new lower bound of 25 for the chromatic number of 8-dimensional Euclidean space, advancing understanding of coloring problems in higher dimensions.
Contribution
It improves the known lower bound for the chromatic number of -dimensional Euclidean space from previous values to at least 25.
Findings
Lower bound for -dimensional space increased to 25
Advances in geometric coloring bounds
Improved understanding of high-dimensional coloring complexity
Abstract
The lower bound for the chromatic number of the Euclidean space of dimension 8 is increased to 25.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research
