2000 character limit reached
On empty pentagons and hexagons in planar point sets (1111.5656v1)
Published 24 Nov 2011 in math.CO and cs.CG
Abstract: 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$.