The Erdős-Szekeres theorem and congruences (Q1957086)

The paper improves the bound on a variant of the Erdős-Szekeres problem in combinatorial geometry. (Recall that the Erdős-Szekeres problem asks for the smallest \(g(m)\), such that any planar set of \(g(m)\) points in general position contains \(m\) vertices of a convex polygon.) Given \(n\) and \(q\), find the smallest \(h\), such that any planar set of \(h\) points in general position contains \(n\) vertices of a convex polygon, such that the number of interior points is divisible by \(q\). The best bound before was due to \textit{Y. Caro} [Discrete Math. 160, 229--233 (1996; Zbl 0868.52006)] and it was like \(2^{c(q)n}\), where \(c(q)\) was a superexponential function of \(q\). The paper under review reduces this bound to \(g(q(n-4)+4)<2^{2qn+O(1)}\).