On dividing planar sets into four, five, and six parts without sufficiently small distances

In this paper, we improve the previously known upper bound on a minimum distance, which is absent among the points of each part in a partition of an arbitrary set of diameter 1 on the plane into five parts.