1. P. Erdős and G. Szekeres, “A combinatorial problem in geometry,” Compositio Math. 2, 463–470 (1935).
2. P. Erdős and G. Szekeres, “On some extremumproblems in elementary geometry,” Ann. Univ. Sci. Budapest Eötvös Sec. Math. 3–4, 53–62 (1961).
3. W. Morris and V. Soltan, “The Erdős-Szekeres problem on points in convex position — a survey,” Bull. Amer. Math. Soc. (N. S.) 37(4), 437–458 (2000).
4. G. Szekeres and L. Peters, “Computer solution to the 17-point Erdős-Szekeres problem,” ANZIAM J. 48(2), 151–164 (2006).
5. G. T’oth and P. Valtr, “The Erdős-Szekeres theorem: upper bounds and related results,” in Math. Sci. Res. Inst. Publ., Vol. 52: Combinatorial and Computational Geometry (Cambridge Univ. Press, Cambridge, 2005), pp. 557–568.