A semi-algebraic version of Zarankiewicz's problem
From MaRDI portal
Publication:2628329
DOI10.4171/JEMS/705zbMath1362.05066arXiv1407.5705OpenAlexW2963208722MaRDI QIDQ2628329
János Pach, Adam Sheffer, Andrew Suk, Jacob Fox, Joshua Zahl
Publication date: 1 June 2017
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.5705
Extremal problems in graph theory (05C35) Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10)
Related Items
On the Zarankiewicz problem for intersection hypergraphs, Turán-type results for intersection graphs of boxes, Bounds on Point Configurations Determined by Distances and Dot Products, Incidences with Curves in ℝ d, Bisector energy and few distinct distances, \(L^2\) bounds for a maximal directional Hilbert transform, The Multivariate Schwartz--Zippel Lemma, Cutting algebraic curves into pseudo-segments and applications, Nondegenerate spheres in four dimensions, Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning, Incidence bounds in positive characteristic via valuations and distality, A refined energy bound for distinct perpendicular bisectors, Concentration estimates for algebraic intersections, Logical labeling schemes, Improved incidence bounds over arbitrary finite fields via the VC-dimension theory, Improved Bounds for Incidences Between Points and Circles, Distinct distances between points and lines, The Schur-Erdős problem for semi-algebraic colorings, Bisectors and pinned distances, The polynomial method over varieties, Covering lattice points by subspaces and counting point-hyperplane incidences, Ramsey-Turán numbers for semi-algebraic graphs, Zarankiewicz’s problem for semilinear hypergraphs, Schwartz-Zippel bounds for two-dimensional products, Model-theoretic Elekes–Szabó in the strongly minimal case, Extremal even-cycle-free subgraphs of the complete transposition graphs, A reduction for the distinct distances problem in \(\mathbb{R}^d\), Unnamed Item, Unnamed Item, Consistent sets of lines with no colorful incidence, Zarankiewicz's problem for semi-algebraic hypergraphs, More distinct distances under local conditions, Incidences with curves in \(\mathbb{R}^d\), A general incidence bound in \(\mathbb{R}^d\), Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions, Planar point sets determine many pairwise crossing segments, Cutting lemma and Zarankiewicz's problem in distal structures, Bounded \(VC\)-dimension implies the Schur-Erdős conjecture, Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications, Representation Complexities of SemiAlgebraic Graphs, Maximal directional operators along algebraic varieties, Geometric and o-minimal Littlewood-Offord problems, Multilevel polynomial partitions and simplified range searching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An incidence theorem in higher dimensions
- On the Erdős distinct distances problem in the plane
- The complexity of many cells in arrangements of planes and related problems
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Extremal problems in discrete geometry
- Combinatorial complexity bounds for arrangements of curves and spheres
- The early evolution of the \(H\)-free process
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Repeated angles in the plane and related problems
- Cutting hyperplanes for divide-and-conquer
- Norm-graphs: Variations and applications
- Algorithms for ham-sandwich cuts
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Complexity of finding irreducible components of a semialgebraic set
- Applications of random sampling in computational geometry. II
- On counting point-hyperplane incidences
- How to find groups?
- Multilevel polynomial partitions and simplified range searching
- Norm-graphs and bipartite Turán numbers
- Crossing patterns of semi-algebraic sets
- Zur Zerlegung von Punktmengen in solche kleineren Durchmessers
- Lower bounds for incidences with hypersurfaces
- Unit Distances in Three Dimensions
- Regularity partitions and the topology of graphons
- Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
- On the Number of Incidences Between Points and Curves
- Unit distance problems
- An improved bound on the number of point-surface incidences in three dimensions
- On the Betti Numbers of Real Varieties
- On a problem of K. Zarankiewicz
- On Sets of Distances of n Points
- Geometric discrepancy. An illustrated guide
- Algorithms in real algebraic geometry
- Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions
