English

On empty pentagons and hexagons in planar point sets

Combinatorics 2011-11-28 v1 Computational Geometry

Abstract

We give improved lower bounds on the minimum number of kk-holes (empty convex kk-gons) in a set of nn points in general position in the plane, for k=5,6k=5,6.

Keywords

Cite

@article{arxiv.1111.5656,
  title  = {On empty pentagons and hexagons in planar point sets},
  author = {Pavel Valtr},
  journal= {arXiv preprint arXiv:1111.5656},
  year   = {2011}
}
R2 v1 2026-06-21T19:40:48.668Z