A new proof of the Erdős-Szekeres convex k-gon result (Q1074867): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0097-3165(86)90106-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041919862 / rank | |||
Normal rank | |||
Revision as of 21:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new proof of the Erdős-Szekeres convex k-gon result |
scientific article |
Statements
A new proof of the Erdős-Szekeres convex k-gon result (English)
0 references
1986
0 references
This is a new, short proof of the following theorem: For any \(k\geq 3\), there is a least integer N such that any set of N points in the plane, no three of which are collinear, contains k points which are the vertices of a convex k-gon. An extension to n-dimensional point sets is indicated.
0 references
Erdős-Szekeres convex k-gon
0 references
Ramsey's theorem
0 references
