Chromatic variants of the Erdős–Szekeres theorem on points in convex position

Abstract

Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the Erdős–Szekeres theorem about subsets of S in convex position, when additional chromatic constraints are considered.