1. O. Aichholzer, [Empty] [colored] k-gons. Recent results on some Erdős–Szekeres type problems, in: Proc. XIII Encuentros de Geometría Computacional, Zaragoza, Spain, 2009, pp. 43–52.
2. The Probabilistic Method;Alon,2008
3. Empty simplices in Euclidean space;Bárány;Canad. Math. Bull.,1987
4. Longest convex chains;Bárány;Random Structures Algorithms,2009
5. A note on Sylvesterʼs four-point problem;Bárány;Studia Sci. Math. Hungar.,2001