Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
From MaRDI portal
Publication:461340
DOI10.1215/00127094-2785915zbMath1301.05351arXiv1207.0705OpenAlexW1971456489MaRDI QIDQ461340
Publication date: 10 October 2014
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.0705
Related Items (13)
Ramsey properties of algebraic graphs and hypergraphs ⋮ Ramsey-type results for semi-algebraic relations ⋮ The general position number of integer lattices ⋮ Ramsey numbers of semi-algebraic and semi-linear hypergraphs ⋮ Semi-algebraic Ramsey numbers ⋮ An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets ⋮ RAMSEY GROWTH IN SOME NIP STRUCTURES ⋮ Ramsey-Turán numbers for semi-algebraic graphs ⋮ On general position sets in Cartesian products ⋮ Cutting lemma and Zarankiewicz's problem in distal structures ⋮ Convex polygons in Cartesian products ⋮ The Erdős-Szekeres Problem ⋮ Three-monotone interpolation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for weak epsilon-nets and stair-convexity
- Stabbing simplices by points and flats
- The colored Tverberg's problem and complexes of injective functions
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
- Betti numbers of semialgebraic sets defined by quantifier-free formulae
- Higher-order Erdős-Szekeres theorems
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- Crossing patterns of semi-algebraic sets
- On the number of halving planes
- Overlap properties of geometric expanders
- Ramsey-type results for semi-algebraic relations
- The Erdos-Szekeres problem on points in convex position – a survey
- One-Sided Epsilon-Approximants
- Algorithms in real algebraic geometry
This page was built for publication: Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
