Density and regularity theorems for semi-algebraic hypergraphs
From MaRDI portal
Publication:5363051
DOI10.1137/1.9781611973730.100zbMath1375.05185OpenAlexW4253250549MaRDI QIDQ5363051
Andrew Suk, János Pach, Jacob Fox
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.100
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Semialgebraic sets and related spaces (14P10) Randomized algorithms (68W20)
Related Items
Nondegenerate spheres in four dimensions, Erdős-Hajnal conjecture for graphs with bounded VC-dimension, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, Semi-algebraic Ramsey numbers, Approximating the Rectilinear Crossing Number, Helly’s theorem: New variations and applications, Regular partitions of gentle graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Zarankiewicz's problem for semi-algebraic hypergraphs, Planar point sets determine many pairwise crossing segments, Representation Complexities of SemiAlgebraic Graphs, Approximating the rectilinear crossing number
