On empty pentagons and hexagons in planar point sets
classification
🧮 math.CO
cs.CG
keywords
emptyboundsconvexgeneralgivegonshexagonsholes
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.