Crossing patterns of semi-algebraic sets
From MaRDI portal
Publication:2566809
DOI10.1016/j.jcta.2004.12.008zbMath1099.14048OpenAlexW2047230132MaRDI QIDQ2566809
Noga Alon, Rom Pinchasi, Radoš Radoičić, János Pach, Micha Sharir
Publication date: 28 September 2005
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2004.12.008
Semialgebraic sets and related spaces (14P10) Fixed points and coincidences in algebraic topology (55M20) Ramsey theory (05D10)
Related Items
Independent sets in algebraic hypergraphs, Clique-stable set separation in perfect graphs with no balanced skew-partitions, Ramsey properties of algebraic graphs and hypergraphs, Overlap properties of geometric expanders, A semi-algebraic version of Zarankiewicz's problem, On the diameter of separated point sets with many nearly equal distances, Ramsey-type results for semi-algebraic relations, A bipartite analogue of Dilworth's theorem, The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor, Excluding hooks and their complements, Turán-type results for partial orders and intersection graphs of convex sets, Erdős-Hajnal conjecture for graphs with bounded VC-dimension, Pure pairs. IV: Trees in bipartite graphs, Ramsey numbers of semi-algebraic and semi-linear hypergraphs, Erdős–Hajnal for graphs with no 5‐hole, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, Semi-algebraic Ramsey numbers, Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs, Crossing and intersecting families of geometric graphs on point sets, Ramsey properties of semilinear graphs, String graphs have the Erdős-Hajnal property, The Schur-Erdős problem for semi-algebraic colorings, Homogeneous selections from hyperplanes, Pure pairs. I: Trees and linear anticomplete pairs, Helly’s theorem: New variations and applications, Regular partitions of gentle graphs, Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1, Some properties of edge intersection graphs of single-bend paths on a grid, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On the speed of algebraically defined graph classes, Implicit representation conjecture for semi-algebraic graphs, RAMSEY GROWTH IN SOME NIP STRUCTURES, Ramsey-Turán numbers for semi-algebraic graphs, Erdős-Hajnal-type results for monotone paths, Induced Ramsey-type theorems, An extension of a theorem of Yao and Yao, Nearly equal distances and Szemerédi's regularity lemma, Erdős-Hajnal-type theorems in hypergraphs, Unnamed Item, Planar point sets determine many pairwise crossing segments, Vertex-minors and the Erdős-Hajnal conjecture, Pure pairs. II: Excluding all subdivisions of a graph, A note on “Regularity lemma for distal structures”, The Erdös--Hajnal Conjecture for Long Holes and Antiholes, Points with large \(\alpha \)-depth, Equality alone does not simulate randomness, Bounded \(VC\)-dimension implies the Schur-Erdős conjecture, A bipartite analogue of Dilworth's theorem for multiple partial orders, Large Homogeneous Submatrices, Erdös--Hajnal Properties for Powers of Sparse Graphs, The Erdős-Hajnal conjecture for paths and antipaths, Pure Pairs VI: Excluding an Ordered Tree, Helly-type problems
Cites Work
- Ramsey-type theorems
- Intersection graphs of curves in the plane
- On range searching with semialgebraic sets
- Crossing families
- Cutting glass
- Not all graphs are segment \(T\)-graphs
- Applications of random sampling in computational geometry. II
- Lines in space: Combinatorics and algorithms
- Weaving patterns of lines and line segments in space
- A Linear Recognition Algorithm for Cographs
- Ramsey graphs cannot be defined by real polynomials
- The Clarkson–Shor Technique Revisited and Extended
- Optimal numberings and isoperimetric problems on graphs
- Some remarks on the theory of graphs
- Algorithms in real algebraic geometry
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Crossing patterns of segments
- Ramsey-type theorems with forbidden subgraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
