The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes.
The author states three results that provide upper estimates for the minimum number \(d\) such that any set in Euclidean \(d\)-dimensional space can be partitioned into subsets of smaller diameter. The results are stated without proof but the author explains that they can be obtained using results and techniques arising from the treatment of the covering problem.
scientific article; zbMATH DE number 2074558