The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes.
From MaRDI portal
Publication:1432248
zbMath1062.52019MaRDI QIDQ1432248
Publication date: 15 June 2004
Published in: Doklady Mathematics (Search for Journal in Brave)
(n)-dimensional polytopes (52B11) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Configuration theorems in linear incidence geometry (51A20)
Related Items (4)
Small Subgraphs in Random Distance Graphs ⋮ New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph ⋮ Independence numbers and chromatic numbers of some distance graphs
This page was built for publication: The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes.
