A minimal planar point set containing a disjoint pair of a convex 4-gon and a convex 6-gon (Q2926088)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A minimal planar point set containing a disjoint pair of a convex 4-gon and a convex 6-gon |
scientific article; zbMATH DE number 6362477
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimal planar point set containing a disjoint pair of a convex 4-gon and a convex 6-gon |
scientific article; zbMATH DE number 6362477 |
Statements
29 October 2014
0 references
convex polygon
0 references
Erdős-Szekeres theorem
0 references
disjoint pair
0 references
A minimal planar point set containing a disjoint pair of a convex 4-gon and a convex 6-gon (English)
0 references
The paper introduces a new variant of the Erdős-Szekeres theorem: what is the smallest number (denoted by \(N(k,\ell)\)) such that for any \(N(k,\ell)\) points in the plane with no 3 of them collinear, is guaranteed to have a disjoint pair of convex \(k\)-gon and convex \(\ell\)-gon? The paper shows that \(17\leq N(4,6)\leq 21\).
0 references
