Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:category |
integer sequence
|
| gptkbp:defines |
smallest number such that any set of that many points in general position contains n points in convex position
|
| gptkbp:describes |
minimum number of points in general position in the plane
|
| gptkbp:field |
combinatorics
|
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Szekeres numbers
|
| gptkbp:lowerBound |
2^{n-2}+1
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:George_Szekeres |
| gptkbp:notation |
ES(n)
|
| gptkbp:relatedTo |
gptkb:Erdős–Szekeres_theorem
|
| gptkbp:sequenceA |
gptkb:OEIS:A000124
|
| gptkbp:studiedBy |
1935
|
| gptkbp:upperBound |
\\binom{2n-4}{n-2}+1
|
| gptkbp:usedIn |
problems about convex polygons
|
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
4
|