A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Discrete Applied Mathematics - Combinatorics and complexity
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Ramsey graphs cannot be defined by real polynomials
Journal of Graph Theory
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Journal of Combinatorial Theory Series A
A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The Clarkson–Shor Technique Revisited and Extended
Combinatorics, Probability and Computing
Nearly equal distances and Szemerédi's regularity lemma
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
On the diameter of separated point sets with many nearly equal distances
European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
Combinatorial complexity in O-minimal geometry
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Note: Points with large α-depth
Journal of Combinatorial Theory Series A
A bipartite analogue of Dilworth's theorem for multiple partial orders
European Journal of Combinatorics
Nearly equal distances and Szemerédi's regularity lemma
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
Erdős-Hajnal-type theorems in hypergraphs
Journal of Combinatorial Theory Series B
Density theorems for intersection graphs of t-monotone curves
GD'12 Proceedings of the 20th international conference on Graph Drawing
Ramsey-type results for semi-algebraic relations
Proceedings of the twenty-ninth annual symposium on Computational geometry
Homogeneous selections from hyperplanes
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
We prove that, for every family F of n semi-algebraic sets in Rd of constant description complexity, there exist a positive constant ε that depends on the maximum complexity of the elements of F, and two subfamilies F1, F2 ⊆ F with at least εn elements each, such that either every element of F1 intersects all elements of F2 or no element of F1 intersects any element of F2. This implies the existence of another constant δ such that F has a subset F' ⊆ F with nδ elements, so that either every pair of elements of F' intersect each other or the elements of F' are pairwise disjoint. The same results hold when the intersection relation is replaced by any other semi-algebraic relation. We apply these results to settle several problems in discrete geometry and in Ramsey theory.