Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes
From MaRDI portal
Publication:859218
zbMath1229.52013MaRDI QIDQ859218
Publication date: 12 January 2007
Published in: Doklady Mathematics (Search for Journal in Brave)
Partitions of sets (05A18) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ On the multiple Borsuk numbers of sets ⋮ 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: Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes
