Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Happy_Ending_problem
|
| gptkbp:countryOfOrigin |
gptkb:Hungary
|
| gptkbp:field |
gptkb:geometry
combinatorics |
| gptkbp:formedBy |
gptkb:Paul_Erdős
gptkb:George_Szekeres 1935 |
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Szekeres conjecture
|
| gptkbp:provenBy |
n ≤ 6
|
| gptkbp:publishedIn |
gptkb:Combinatorial_Problems_in_Geometry
|
| gptkbp:relatedConcept |
gptkb:Ramsey_theory
gptkb:Erdős–Szekeres_theorem |
| gptkbp:relatedTo |
convex polygon
points in general position |
| gptkbp:sentence |
For every positive integer n ≥ 3, there exists a minimum number ES(n) such that any set of at least ES(n) points in the plane in general position contains n points that form the vertices of a convex n-gon.
|
| gptkbp:status |
open
|
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
4
|