1. Aichholzer, O., Hackl, T., Pilz, A., Ramos, P.A, Sacristán, V., Vogtenhuber, B.: Empty triangles in good drawings of the complete graph. http://arxiv.org/abs/1306.5081 (2013)
2. Bárány, I., Valtr, P.: Planar point sets with a small number of empty convex polygons. Stud. Sci. Math. Hung. 41(2), 243–269 (2004)
3. Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)
4. Fulek, R.: Estimating the number of disjoint edges in simple topological graphs via cylindrical drawings. SIAM J. Discrete Math. 28(1), 116–121 (2014)
5. Fulek, R., Ruiz-Vargas, A.J.: Topological graphs: empty triangles and disjoint matchings. In: Proceedings of the 2013 Symposium on Computational Geometry (2013)