On the chromatic number of Euclidean space and the Borsuk problem
From MaRDI portal
Publication:2518013
DOI10.1134/S0001434608030322zbMath1291.05073OpenAlexW2024861937MaRDI QIDQ2518013
I. M. Shitova, Andrei M. Raigorodskii
Publication date: 12 January 2009
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434608030322
Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10)
Related Items
On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
Cites Work