Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
gptkb:geometry
combinatorics |
| gptkbp:generalizes |
gptkb:Erdős–Szekeres_conjecture
|
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Szekeres theorem
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:George_Szekeres |
| gptkbp:publishedIn |
gptkb:Combinatorial_Problems_and_Exercises
|
| gptkbp:relatedTo |
gptkb:Ramsey_theory
convex polygon monotone subsequence |
| gptkbp:sentence |
Any set of at least 2^{n-2}+1 points in general position in the plane contains n points that form the vertices of a convex polygon.
Any sequence of n^2+1 distinct real numbers contains a monotonically increasing or decreasing subsequence of length n+1. |
| gptkbp:yearProposed |
1935
|
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
4
|