Point configurations in \(d\)-space without large subsets in convex position (Q1423586)

The authors give a lower bound for the Erdős-Szekeres number in higher dimension. (For the Erdős-Szekeres theorem see among others the original publications by \textit{P. Erdős} and \textit{G. Szekeres} [Compos. Math. 2, 463--470 (1935; Zbl 0012.27010) and Ann. Univ. Sci. Budap. Rolande Eötvös, Sect. Math. 3--4, 53--62 (1961; Zbl 0103.15502)].) They show in Euclidean \(d\)-space \(\mathbb{R}^d\), \(d\geq 2\): For every \(N> d\) there exists a configuration of \(N\) points in general position in \(\mathbb{R}^d\) which does not contain more than \(c'(\log N)^{d-1}\) points in convex position, where the constant \(c'= C_d'\) only depends on the dimension \(d\). Here a set of points is called in convex position if none of the points lies in the convex hull of the other. Two different proofs are given.