On Upper Bounds for the Number of Parts in the Problem of Partitioning Sets into Parts of Smaller Diameter

Mathematical Notes 2026 Open access

Read full text

Authors: Arthur Bikeev, Andrei Mikhailovich Raigorodskii

DOI: 10.1134/s0001434626601899

Cited by: 0

References: 26

Abstract

Abstract This paper deals with problems associated with the classical Borsuk partition problem.

Limits and Structures in Graph Theory Mathematical Approximation and Integration Digital Image Processing Techniques

References 26