Chapter

The Mathematics of Paul Erdös II

Volume 14 of the series Algorithms and Combinatorics pp 324-328

On Mutually Avoiding Sets

  • Pavel ValtrAffiliated withDepartment of Applied Mathematics, Charles UniversityGraduiertenkolleg “Algorithmische Diskrete Mathematik”, Fachbereich Mathematik, Freie Universität Berlin

* Final gross prices may vary according to local VAT.

Get Access

Summary

Two finite sets of points in the plane are called mutually avoiding if any straight line passing through two points of anyone of these two sets does not intersect the convex hull of the other set. For any integer n, we construct a set of n points in general position in the plane which contains no pair of mutually avoiding sets of size more than \(O\left( {\sqrt n } \right)\) each. The given bound is tight up to a constant factor, since Aronov et al. [1] showed a polynomial-time algorithm for finding two mutually avoiding sets of size \(\Omega \left( {\sqrt n } \right)\) each in any set of n points in general position in the plane.