A partitioned version of the Erdős-Szekeres theorem for quadrilaterals (Q1423590): Difference between revisions

In this article a partitioned version of the Erdős-Szekeres theorem for the case \(k=4\) is proved. (For this classical theorem of combinatorial geometry see among other things the original publications of \textit{P. Erdős} and \textit{G. Szekeres} in [Compos. Math. 2, 463--470 (1935; Zbl 0012.27010)] and in [Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Math. 3--4, 53--62 (1961; Zbl 0103.15502)].) The author shows: Any finite set \(X\subset\mathbb{R}^2\) of points in general position can be partitoned into sets \(X_0\), \(X_{ik}\) (\(i= 1,2,3,4\); \(k= 1,\dots, 26\)), so that \(| X_{1k}|=| X_{2k}|=| X_{3k}|=| X_{4k}|\) and \(| X_0|\leq 4\) and besides for all \(k\) every transversal \(\{x_1,x_2,x_3,x_4\}\) with \(x_i\in X_{ik}\), is in convex position. For that purpose the author proves a partitioned version of the ``same type lemma'' by \textit{I. Bárány} and \textit{P. Valtr} [Discrete Comput. Geom. 19, No. 3, 335--342 (1998; Zbl 0914.52007)].