A sufficient condition for the existence of large empty convex polygons (Q1864123): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Pavel Valtr / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Johann Linhart / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00454-002-2898-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2090067893 / rank | |||
Normal rank |
Latest revision as of 20:48, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A sufficient condition for the existence of large empty convex polygons |
scientific article |
Statements
A sufficient condition for the existence of large empty convex polygons (English)
0 references
17 March 2003
0 references
A set \(A\) of points in the plane is said to be in convex position if the points of \(A\) are the vertices of a convex polygon. Let \(P\) be a set of points in the plane in general position (no three on a line). \(P\) is called \( k\)-convex if no triangle determined by \(P\) contains more than \(k\) points of \( P\) in its interior. A subset \(A\) of \(P\) in convex position is said to form an empty polygon if the convex hull of \(A\) contains no points of \(P\setminus A\). The main result of this paper says: for any \(k\), \(n\) there is an \( N=N(k,n)\) such that any \(k\)-convex set of at least \(N\) points in general position in the plane contains an empty \(n\)-gon. For \(k=1\) this has been shown already by Gy. Károlyi et al. [Stud. Sci. Math. Hung. 38, 245-259 (2001; Zbl 1006.52007)]. The analogous statement in \(\mathbb{R}^{d}\) is proved for all odd \(d\geq 3\) and is conjectured to be true for any \(d\geq 2\).
0 references
Erdős-Szekeres theorem
0 references
empty polygons
0 references