Zarankiewicz's problem for semi-algebraic hypergraphs

DOI10.1016/J.JCTA.2018.04.007MaRDI QIDQ721064zbMATH OpenOpenAlexFDO

Authors Thao Do

Publication date 18 July 2018

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.01979

zbMATH Keywords

incidence geometrypolynomial partitioningintersection hypergraphssemi-algebraic hypergraphsunit area problemunit minor problemZarankiewicz's problem

Mathematics Subject Classification ID

Hypergraphs (05C65)

Abstract: Zarankiewicz's problem asks for the largest possible number of edges in a graph that does not contain a $K_{u,u}$ subgraph for a fixed positive integer $u$. Recently, Fox, Pach, Sheffer, Sulk and Zahl considered this problem for semi-algebraic graphs, where vertices are points in $mathbb{R}^d$ and edges are defined by some semi-algebraic relations. In this paper, we extend this idea to semi-algebraic hypergraphs. For each $kgeq2$, we find an upper bound on the number of hyperedges in a $k$-uniform $k$-partite semi-algebraic hypergraph without $K_{u_1,dots,u_k}$ for fixed positive integers $u_1,dots,u_k$. When $k=2$, this bound matches the one of Fox et.al. and when $k=3$, it is ${\displaystyle }$Oleft((mnp)^{frac{2d}{2d+1}+varepsilon}+m(np)^{frac{d}{d+1}+varepsilon}+n(mp)^{frac{d}{d+1}+varepsilon}+p(mn)^{frac{d}{d+1}+varepsilon}+mn+np+pm ight),${\displaystyle }$ where $m,n,p$ are the sizes of the parts of the tripartite hypergraph and $varepsilon$ is an arbitrarily small positive constant. We then present applications of this result to a variant of the unit area problem, the unit minor problem and intersection hypergraphs.

Recommendations

• Zarankiewicz's problem for semilinear hypergraphs
• On the Zarankiewicz problem for intersection hypergraphs
• On the Zarankiewicz problem for intersection hypergraphs
• A semi-algebraic version of Zarankiewicz's problem
• Ramsey numbers of semi-algebraic and semi-linear hypergraphs
• Ramsey-Turán numbers for semi-algebraic graphs
• Density and regularity theorems for semi-algebraic hypergraphs
• An extension of the Erdős-Ginzburg-Ziv theorem to hypergraphs
• The Schur-Erdős problem for semi-algebraic colorings
• Ramsey properties of algebraic graphs and hypergraphs

Cites work

• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• scientific article; zbMATH DE number 3223507 (Why is no real title available?)
• A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
• A semi-algebraic version of Zarankiewicz's problem
• A separator theorem for string graphs and its applications
• An incidence theorem in higher dimensions
• Applications of a new separator theorem for string graphs
• Density and regularity theorems for semi-algebraic hypergraphs
• Extremal problems in discrete geometry
• Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
• Lower bounds for incidences with hypersurfaces
• On extremal problems of graphs and generalized graphs
• On the Betti Numbers of Real Varieties
• On the Erdős distinct distances problem in the plane
• On the Number of Incidences Between Points and Curves
• On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
• On the Zarankiewicz problem for intersection hypergraphs
• On the number of cells defined by a family of polynomials on a variety
• On totally positive matrices and geometric incidences
• Ramsey-type results for semi-algebraic relations
• Separator theorems and Turán-type results for planar intersection graphs
• Some extremal problems in geometry
• The number of unit-area triangles in the plane: theme and variation

Cited in

(10)

• On the Zarankiewicz problem for intersection hypergraphs
• Nondegenerate spheres in four dimensions
• The Zarankiewicz problem in 3-partite graphs
• Density and regularity theorems for semi-algebraic hypergraphs
• Continuous Tur\'an numbers
• On the Zarankiewicz problem for intersection hypergraphs
• A semi-algebraic version of Zarankiewicz's problem
• Zarankiewicz's problem for semilinear hypergraphs
• Geometric and o-minimal Littlewood-Offord problems
• Representation complexities of semialgebraic graphs

This page was built for publication: Zarankiewicz's problem for semi-algebraic hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721064)