Around Borsuk's hypothesis (Q2519261)

In 1933 K.~Borsuk posed the question: Is it true that every bounded set in \(\mathbb{R}^{n}\) admits a partition into \(n+1\) parts of smaller diameter? The problem attracted many researchers, among them were prominent mathematicians. Numerous methods and results arose when making attempts to solve the problem. The hypothesis (conjecture) was proved for \(n=2\), 3 and for some special classes of sets. In 1993 counterexamples (for rather large dimensions \(n\)) were constructed answering the question negative. The paper under review surveys numerous general approaches to solving Borsuk's problem, involving several other classical problems. Many interesting results that have some connection with Borsuk's problem are discussed. Below the contents of the article are given: Introduction 1. Notation and various versions of problem formulation 2. Universal covers 3. Universal covering systems 4. Truncations of an octahedron 5. Spherical u.c.s. in dimension 3 6. Sets of constant width 7. Covering the sets by balls 8. Special classes of sets 9. Counterexamples to Borsuk's hypothesis 10. Borsuk's, Grünbaum's, and the Nelson--Erdös--Hadwiger problems for lattice polyhedra and graphs 11. Chromatic numbers of finite geometric graphs and the relation between the Borsuk and Nelson--Erdös--Hadwiger problems References The bibliography includes 123 sources.