Computational geometry column 50
ACM SIGACT News
A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
Computational Geometry and Graph Theory
Computational Geometry: Theory and Applications
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
SIAM Journal on Discrete Mathematics
Monotonic polygons and paths in weighted point sets
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Computational geometry column 53
ACM SIGACT News
Large convex holes in random point sets
Computational Geometry: Theory and Applications
Monochromatic empty triangles in two-colored point sets
Discrete Applied Mathematics
Topological graphs: empty triangles and disjoint matchings
Proceedings of the twenty-ninth annual symposium on Computational geometry
On planar point sets with the pentagon property
Proceedings of the twenty-ninth annual symposium on Computational geometry
On the Erdős-Szekeres n-interior-point problem
European Journal of Combinatorics
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
Lower bounds for the number of small convex k-holes
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Erdős asked whether every sufficiently large set of points in general position in the plane contains six points that form a convex hexagon without any points from the set in its interior. Such a configuration is called an empty convex hexagon. In this paper, we answer the question in the affirmative. We show that every set that contains the vertex set of a convex 9-gon also contains an empty convex hexagon.