2 papers
math.CO2025
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 of parts of sma…
math.CO2020
Criteria for integer and modulo 2 embeddability of graphs to surfaces
Arthur Bikeev
The study of graph drawings on 2-surfaces is an active area of mathematical research. Our main results are criteria for integer and modulo 2 embeddability of graphs to surfaces.