Borsuk's conjecture

An example of a hexagon cut into three pieces of smaller diameter.
Unsolved problem in mathematics
What is the lowest n such that not every bounded subset E of the space can be partitioned into (n + 1) sets, each of which has a smaller diameter than E?

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.