Lifting of a bound for the chromatic number of \(\mathbb R^n\) to higher dimensions

DOI10.1134/S1064562409060131zbMath1285.05062OpenAlexW1986437043MaRDI QIDQ845498

Andrey B. Kupavskii

Publication date: 29 January 2010

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562409060131

zbMATH Keywords

chromatic number of Euclidean space

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Coloring of graphs and hypergraphs (05C15)

Related Items

The chromatic number of \(\mathbb R^n\) with a set of forbidden distances

Cites Work

• Coloring abelian groups
• On the space chromatic number
• Finite Euclidean Ramsey theory
• Distances realized by sets covering the plane
• The realization of distances within sets in Euclidean space