A positive fraction Erdos-Szekeres theorem

55Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We prove a fractional version of the Erdos-Szekeres theorem: for any k there is a constant ck > 0 such that any sufficiently large finite set X ⊂ ℝ2 contains k subsets Yl,...,Yk, each of size ≥ ck |X|, such that every set {yl,...,yk} with yi ∈ Yi is in convex position. The main tool is a lemma stating that any finite set X ⊂ ℝd contains "large" subsets Yl,...,Yk such that all sets {yl,...,yk} with yi ∈ Yi have the same geometric (order) type. We also prove several related results (e.g., the positive fraction Radon theorem, the positive fraction Tverberg theorem).

Cite

CITATION STYLE

APA

Bárány, I., & Valtr, P. (1998). A positive fraction Erdos-Szekeres theorem. Discrete and Computational Geometry, 19(3), 335–342. https://doi.org/10.1007/PL00009350

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free