Pages that link to "Item:Q4501063"
From MaRDI portal
The following pages link to The Erdos-Szekeres problem on points in convex position – a survey (Q4501063):
Displaying 50 items.
- Erdős-Szekeres without induction (Q309659) (← links)
- On the order dimension of convex geometries (Q382888) (← links)
- Chromatic numbers of copoint graphs of convex geometries (Q397165) (← links)
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations (Q452006) (← links)
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 (Q461340) (← links)
- Computer solution of the almost empty hexagon problem (Q650447) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696) (← links)
- Around Erdős-Szekeres problems (Q736016) (← links)
- Erdős-Szekeres theorem for lines (Q745670) (← links)
- Obstacle numbers of graphs (Q977184) (← links)
- More on an Erdős-Szekeres-type problem for interior points (Q1042448) (← links)
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position. (Q1410590) (← links)
- Point configurations in \(d\)-space without large subsets in convex position (Q1423586) (← links)
- On scattered convex geometries (Q1686202) (← links)
- Point sets with small integer coordinates and no large convex polygons (Q1704901) (← links)
- The non-planarity of \(K_{5}\) and \(K_{3,3}\) as axioms for plane ordered geometry (Q1926115) (← links)
- Two upper bounds for the Erdős-Szekeres number with conditions (Q1943650) (← links)
- Large convex holes in random point sets (Q1947987) (← links)
- The Erdős-Szekeres theorem and congruences (Q1957086) (← links)
- On weighted sums of numbers of convex polygons in point sets (Q2167313) (← links)
- Disjoint empty convex pentagons in planar point sets (Q2250824) (← links)
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem (Q2251909) (← links)
- Three-monotone interpolation (Q2354672) (← links)
- Erdős--Szekeres theorem with forbidden order types (Q2368653) (← links)
- On the Erdös-Szekeres problem (Q2377533) (← links)
- Finite sets as complements of finite unions of convex sets (Q2391197) (← links)
- Supervised box clustering (Q2418297) (← links)
- Erdős-Szekeres ``happy end''-type theorems for separoïds (Q2427552) (← links)
- Representing finite convex geometries by relatively convex sets (Q2434746) (← links)
- Interior points in the Erdős-Szekeres theorems (Q2435979) (← links)
- Higher-order Erdős-Szekeres theorems (Q2437401) (← links)
- Almost empty hexagons (Q2453368) (← links)
- A simple proof for open cups and caps (Q2462332) (← links)
- Empty convex hexagons in planar point sets (Q2482196) (← links)
- Coloring copoints of a planar point set (Q2499594) (← links)
- On the Erdős-Szekeres \(n\)-interior-point problem (Q2509739) (← links)
- More on planar point subsets with a specified number of interior points (Q2518026) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- Regular systems of paths and families of convex sets in convex position (Q2790591) (← links)
- The Erdős-Szekeres Problem (Q2826813) (← links)
- (Q2857333) (← links)
- THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS (Q2874619) (← links)
- On the decay of the smallest singular value of submatrices of rectangular matrices (Q3181168) (← links)
- Convex Polygons in Geometric Triangulations (Q3449827) (← links)
- On the Erdős–Szekeres problem in combinatorial geometry (Q3503469) (← links)
- Computer solution to the 17-point Erdős-Szekeres problem (Q3541568) (← links)
- A Note on the Number of Empty Triangles (Q4899285) (← links)
- Maximum Rectilinear Convex Subsets (Q5149759) (← links)
