On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (Q5951972): Difference between revisions

Consider \(2n\) disjoint compact convex sets in the plane all having the same width in some direction. The author's main theorem says that always \([2n/3]\) pairs of the sets can be matched by disjoint line segments and that it is possible that not more than \([4n/5]\) pairs can be matched. The paper ends with two conjectures.