首页 | 本学科首页   官方微博 | 高级检索  
     


Empty Convex Hexagons in Planar Point Sets
Authors:Tobias Gerken
Affiliation:1. Zentrum Mathematik, Technische Universit?t München, Boltzmannstr. 3, 85747, Garching, Germany
Abstract: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.
Keywords:Erdő  s-Szekeres problem  Ramsey theory  Convex polygons and polyhedra  Empty hexagon problem
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号