arXiv:1111.5656 [math.CO]AbstractReferencesReviewsResources
On empty pentagons and hexagons in planar point sets
Published 2011-11-24Version 1
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$.
Related articles: Most relevant | Search more
arXiv:math/9807022 [math.CO] (Published 1998-07-03)
The leafage of a chordal graph
Lower bounds on maximal determinants of +-1 matrices via the probabilistic method
Lower bounds for on-line graph colorings