Abstract.
We prove a fractional version of the Erdős—Szekeres theorem: for any k there is a constant c k > 0 such that any sufficiently large finite set X⊂ R 2 contains k subsets Y 1 , ... ,Y k , each of size ≥ c k |X| , such that every set {y 1 ,...,y k } with y i ε Y i is in convex position. The main tool is a lemma stating that any finite set X⊂ R d contains ``large'' subsets Y 1 ,...,Y k such that all sets {y 1 ,...,y k } with y i ε Y i have the same geometric (order) type. We also prove several related results (e.g., the positive fraction Radon theorem, the positive fraction Tverberg theorem). <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p335.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader>
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received March 8, 1996, and in revised form June 24, 1996.
Rights and permissions
About this article
Cite this article
Bárány, I., P. Valtr, . A Positive Fraction Erdos - Szekeres Theorem . Discrete Comput Geom 19, 335–342 (1998). https://doi.org/10.1007/PL00009350
Issue Date:
DOI: https://doi.org/10.1007/PL00009350