arXiv Analytics

Sign in

arXiv:1111.5656 [math.CO]AbstractReferencesReviewsResources

On empty pentagons and hexagons in planar point sets

Pavel Valtr

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
arXiv:1211.3248 [math.CO] (Published 2012-11-14, updated 2013-05-05)
Lower bounds on maximal determinants of +-1 matrices via the probabilistic method
arXiv:1404.7259 [math.CO] (Published 2014-04-29, updated 2015-10-09)
Lower bounds for on-line graph colorings