New lower bounds on $\chi(R^d)$ for $d=8 \dots 12$
Matthew Kahle, Birra Taha

TL;DR
This paper improves the known lower bounds for the chromatic number of Euclidean space in dimensions 8 to 12 through extensive computational methods.
Contribution
It provides new, tighter lower bounds for the chromatic number in specific small dimensions, advancing understanding in geometric graph theory.
Findings
Improved lower bounds for dimensions 8 to 12
Extensive computational approach using Sage
Enhanced understanding of Euclidean space coloring
Abstract
We improve the best lower bounds on the chromatic number of Euclidean space in small dimensions. The new results depend on extensive computations in Sage.
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 · graph theory and CDMA systems
