Summary
Two finite sets of points in the plane are called mutually avoiding if any straight line passing through two points of any one 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 \(\mathcal{O}(\sqrt{n})\) 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 (\sqrt{n})\) each in any set of n points in general position in the plane.
This research was supported by “Deutsche Forschungsgemeinschaft”, grant We 1265/2–1 and by Charles University grant No. 351.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
B. Aronov, P. Erdős, W. Goddard, D. J. Kleitman, M. Klugerman, J. Pach, and L. J. Schulman, Crossing Families, Combinatorica 14 (1994), 127–134; also Proc. Seventh Annual Sympos. on CompoGeom., ACM Press, New York (1991), 351–356.
I. Bárány, personal communication.
P. Erdős, On some problems of elementary and combinatorial geometry, Ann. Mat. Pura. Appl. (4) 103 (1975),99–108.
P. Erdős and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935),463–470.
L. Fejes Tóth, Regular figures, Pergamon Press, Oxford 1964.
H. Harborth, Konvexe Fünfecke in ebenen Punktmengen, Elem. Math. 33 (1978), 116–118.
J. D. Horton, Sets with no empty convex 7-gons, Canadian Math. Bull. 26 (1983), 482–484.
J. Pach, Notes on Geometric Graph Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 6 (1991), 273–285.
P. Valtr, Convex independent sets and 7-holes in restricted planar point sets, Discrete Comput. Geom. 7 (1992), 135–152.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Valtr, P. (2013). On Mutually Avoiding Sets. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős I. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7258-2_36
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7258-2_36
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7257-5
Online ISBN: 978-1-4614-7258-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)