Erdős–Szekeres Theorem for Lines

Bárány, Imre and Roldán-Pensado, E. and Tóth, Géza (2015) Erdős–Szekeres Theorem for Lines. DISCRETE AND COMPUTATIONAL GEOMETRY, 54 (3). pp. 669-685. ISSN 0179-5376

Text art_10.1007_s00454_015_9705_y_u.pdf Restricted to Repository staff only Download (526kB) | Request a copy

Abstract

According to the Erdős–Szekeres theorem, for every n, a sufficiently large set of points in general position in the plane contains n in convex position. In this note we investigate the line version of this result, that is, we want to find n lines in convex position in a sufficiently large set of lines that are in general position. We prove almost matching upper and lower bounds for the minimum size of the set of lines in general position that always contains n in convex position. This is quite unexpected, since in the case of points, the best known bounds are very far from each other. We also establish the dual versions of many variants and generalizations of the Erdős–Szekeres theorem. © 2015, Springer Science+Business Media New York.

Actions (login required)

Edit Item