
The Borsuk problem in geometry, for historical reasons incorrectly called Borsuk's conjecture, is a question in discrete geometry. It is named after Karol Borsuk.
In 1932, Karol Borsuk showed that an ordinary 3-dimensional ball in Euclidean space can be easily dissected into 4 solids, each of which has a smaller diameter than the ball, and generally -dimensional ball can be covered with compact sets of diameters smaller than the ball. At the same time he proved, using Borsuk–Ulam theorem, that subsets are not enough in general. That led Borsuk to a general question:
Die folgende Frage bleibt offen: Lässt sich jede beschränkte Teilmenge des Raumes in Mengen zerlegen, von denen jede einen kleineren Durchmesser als hat?
The following question remains open: Can every bounded subset of the space be partitioned into sets, each of which has smaller diameter than ?
— Drei Sätze über die n-dimensionale euklidische Sphäre
The question was answered in the positive in the following cases:
The problem was finally solved in 1993 by Jeff Kahn and Gil Kalai, who showed that the general answer to Borsuk's question is no. They claim that their construction shows that pieces do not suffice for and for each . However, as pointed out by Bernulf Weißbach, the first part of this claim is, in fact, false. But after improving a suboptimal conclusion within the corresponding derivation, one can indeed verify one of the constructed point sets as a counterexample for (as well as all higher dimensions up to 1560).
Their result was improved in 2003 by Hinrichs and Richter, who constructed finite sets for , which cannot be partitioned into parts of smaller diameter.
In 2013, Andriy V. Bondarenko had shown that Borsuk's conjecture is false for all . Shortly after, Thomas Jenrich derived a 64-dimensional counterexample from Bondarenko's construction, which stood as the record until May 2026, when Max Grinsztajn, assisted by OpenAI's GPT-5.5 Pro, lowered the minimum known failing dimension to 63 by constructing a 321-point three-distance configuration requiring at least 65 parts.
Apart from finding the minimum number of dimensions such that the number of pieces , mathematicians are interested in finding the general behavior of the function . Kahn and Kalai show that in general (that is, for sufficiently large), one needs many pieces. They also quote the upper bound by Oded Schramm, who showed that for every and sufficiently large (in terms of ) one has .
The correct order of magnitude of is still unknown, although it is conjectured that grows exponentially in .
Arguably, one of the most important unsolved problems about behavior of is whether considering only finite sets would change the value of the function, because it is not obvious a priori that a counterexample graph with infinite points can be converted into a finite one. In 2026, OpenAI claimed to have constructed counterexample to Borsuk's conjecture in , but the construction has infinitely many points and therefore (if correct) does not disprove finite variation of Borsuk's conjecture in .
Another point of interest is whether Borsuk's conjecture holds for two-distance sets.
Instead of working in one may also consider -dimensional hyperbolic or spherical spaces. In both cases, it is known that Borsuk's conjecture holds for and .
Oded Schramm also worked on a related question: a body of constant width is said to have effective radius if , where is the unit ball in ; he proved the lower bound , where is the smallest effective radius of a body of constant width 2 in and asked if there exists such that for all , that is if the gap between the volumes of the smallest and largest constant-width bodies grows exponentially. In 2024, a preprint by Arman, Bondarenko, Nazarov, Prymak, Radchenko reported to have answered this question in the affirmative giving a construction that satisfies .