The following pages link to (Q5290279):
Displaying 42 items.
- Almost empty monochromatic triangles in planar point sets (Q299089) (← links)
- An improved upper bound for the Erdős-Szekeres conjecture (Q306509) (← links)
- Erdős-Szekeres without induction (Q309659) (← links)
- Separating families of convex sets (Q364852) (← links)
- On the order dimension of convex geometries (Q382888) (← links)
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations (Q452006) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Almost empty monochromatic quadrilaterals in planar point sets (Q722152) (← links)
- Erdős-Szekeres theorem for lines (Q745670) (← links)
- The exact bound in the Erdős-Ko-Rado theorem (Q761464) (← links)
- New upper bounds for the Davenport and for the Erdős-Ginzburg-Ziv constants (Q766082) (← links)
- Abstract order type extension and new results on the rectilinear crossing number (Q870421) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- Economical tight examples for the biased Erdős-Selfridge theorem (Q932605) (← links)
- Obstacle numbers of graphs (Q977184) (← links)
- On the generalized Erdös-Szekeres conjecture -- a new upper bound (Q1126297) (← links)
- Point sets with small integer coordinates and no large convex polygons (Q1704901) (← links)
- Two upper bounds for the Erdős-Szekeres number with conditions (Q1943650) (← links)
- The Erdős-Szekeres theorem and congruences (Q1957086) (← links)
- Faster counting empty convex polygons in a planar point set (Q2059898) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
- Empty monochromatic simplices (Q2250050) (← links)
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets (Q2287740) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Interior points in the Erdős-Szekeres theorems (Q2435979) (← links)
- Almost empty hexagons (Q2453368) (← links)
- Empty convex hexagons in planar point sets (Q2482196) (← links)
- Coloring copoints of a planar point set (Q2499594) (← links)
- The threshold for the Erdős, Jacobson and Lehel conjecture to be true (Q2508636) (← links)
- On the Erdős-Szekeres \(n\)-interior-point problem (Q2509739) (← links)
- Regular systems of paths and families of convex sets in convex position (Q2790591) (← links)
- On Erdős-Szekeres-type problems (Q2851501) (← links)
- On the Erdős–Szekeres problem in combinatorial geometry (Q3503469) (← links)
- A new exponential upper bound for the Erd\H{o}s-Ginzburg-Ziv constant (Q5109331) (← links)
- Specified holes with pairwise disjoint interiors in planar point sets (Q5154553) (← links)
- On the Erdős-Szekeres convex polygon problem (Q5280069) (← links)
- A SAT attack on the Erdős-Szekeres conjecture (Q5920081) (← links)
- An upper bound on the mean value of the Erdős–Hooley Delta function (Q6139784) (← links)
- (Q6179339) (← links)
- A SAT attack on higher dimensional Erdős-Szekeres numbers (Q6604680) (← links)
- The never-ending happiness of Paul Erdős's mathematics (Q6638646) (← links)
- On the Erdős-Tuza-Valtr conjecture (Q6655707) (← links)
