4.1 Article Proceedings Paper

Empty convex hexagons in planar point sets

期刊

DISCRETE & COMPUTATIONAL GEOMETRY
卷 39, 期 1-3, 页码 239-272

出版社

SPRINGER
DOI: 10.1007/s00454-007-9018-x

关键词

Erdos-Szekeres problem; Ramsey theory; convex polygons and polyhedra; empty hexagon problem

向作者/读者索取更多资源

Erdos 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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.1
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据