1. Aichholzer, O., Fabila-Monroy, R., Hackl, T., Huemer, C., Pilz, A., Vogtenhuber, B.: Lower bounds for the number of small convex $$k$$ k -holes. In: Proceedings of 24th Canadian Conference on Computational Geometry CCCG’12, Charlottetown, Canada, pp. 247–252. (2012)
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–266 (2004)
3. Erdős, P.: Some more problems on elementary geometry. Aust. Math. Soc. Gaz. 5, 52–54 (1978)
4. Fulek, R., Ruiz-Vargas, A.J.: Topological graphs: empty triangles and disjoint matchings. In: Proceedings of 29th ACM Symposium on Computational Geometry (SoCG’13), Rio de Janeiro, Brazil, pp. 259–265 (2013)
5. Gerken, T.: Empty convex hexagons in planar point sets. Discrete Comput. Geom. 39(1–3), 239–272 (2008)