On upper bounds on the number of parts in the problem of partitioning sets into parts of smaller diameter

Arthur Igorevich Bikeev, Andrei Mikhailovich Raigorodskii

In the present paper, we study problems related to the classical Borsuk's problem. Recall that the Borsuk's problem consists in finding the smallest number $f(n)$ of parts of sma…