Name
Abstract | ||
|---|---|---|
According to the Erdős–Szekeres theorem, every set of n points in the plane contains roughly logn points in convex position. We investigate how this bound changes if our point set does not contain a subset that belongs to a fixed order type. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s00454-012-9424-6 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Order type,Erdős–Szekeres theorem,Combinatorial convexity | Intersection theorem,Discrete mathematics,Combinatorics,Brouwer fixed-point theorem,Krein–Milman theorem,Kakutani fixed-point theorem,Convex position,Fixed-point theorem,Danskin's theorem,Mathematics,Erdős–Szekeres theorem | Journal |
Volume | Issue | ISSN |
48 | 2 | 0179-5376 |
Citations | PageRank | References |
1 | 0.34 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gyula Károlyi | 1 | 109 | 16.09 |
| Géza Tóth | 2 | 581 | 55.60 |