Empty convex polygons in almost convex sets |
| |
| Authors: | Pavel Valtr Gábor Lippner Gyula Károlyi |
| |
| Affiliation: | 1.School of Mathematical Sciences,South China Normal University,Guangzhou,China;2.Guangdong University of Finance,Guangzhou,China |
| |
| Abstract: | A finite set of points, in general position in the plane, is almost convex if every triple determines a triangle with at most one point in its interior. For every ℓ ≥ 3, we determine the maximum size of an almost convex set that does not contain the vertex set of an empty convex ℓ-gon. Partially supported by grants T043631 and NK67867 of the Hungarian NFSR (OTKA). |
| |
| Keywords: | point configurations combinatorial convexity Erdő s-Szekeres problem empty polygons |
| 本文献已被 SpringerLink 等数据库收录！ |
