On the Chromatic Number of ℝⁿ for Small Values of n

2014/08/09 by Geoffrey Exoo, Exoo, Geoffrey, Dan Ismailescu +1
Computer Science · Engineering · Mathematics · #05C15 #52C10 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Metric Geometry (math.MG) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1408.2002

openalex publication_date 2014/08/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The lower bound for the chromatic number of ℝⁿ is improved for n = 6, 7, 10, 11, 12, 13 and 14.

Related

• New lower bounds on χ(R^d) for d=8 … 12
• On the chromatic numbers of spheres in \mathbb Rⁿ
• A new proof of the Larman-Rogers upper bound for the chromatic number of\n the Euclidean space
• Lower bounds for multicolor van der Waerden numbers
• On Chromatic Numbers of Integer and Rational Lattices