On the chromatic number of \(\mathbb{R}^{9}\)
From MaRDI portal
Publication:2451718
DOI10.1007/s10958-009-9708-4zbMath1288.05093MaRDI QIDQ2451718
Andrey B. Kupavskii, Andrei M. Raigorodskii
Publication date: 4 June 2014
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-009-9708-4
05C15: Coloring of graphs and hypergraphs
Related Items
Cites Work
- On the independence number of distance graphs with vertices in \(\{-1,0,1\}^n\)
- On the space chromatic number
- Finite Euclidean Ramsey theory
- The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
- Borsuk's problem and the chromatic numbers of some metric spaces
- On Ramsey Type Problems in Combinatorial Geometry
- The realization of distances within sets in Euclidean space
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item