We give improved lower bounds on the minimum number of k-holes (empty convex k-gons) in a set of n points in general position in the plane, for k=5, 6.
Cite as: Valtr, P. (2012). On empty pentagons and hexagons in planar point sets. In Proc. Computing: The Australasian Theory Symposium (CATS 2012) Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 47-48
(from crpit.com)
(local if available)