On the Zarankiewicz problem for intersection hypergraphs

DOI10.1016/j.jcta.2016.02.001zbMath1334.05096OpenAlexW2287336200MaRDI QIDQ272311

János Pach, Nabil H. Mustafa

Publication date: 20 April 2016

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.2016.02.001

zbMATH Keywords

Zarankiewicz problemintersection graphscuttingssimplices

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items

Zarankiewicz’s problem for semilinear hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On counting pairs of intersecting segments and off-line triangle range searching
• Combinatorial complexity bounds for arrangements of curves and spheres
• Separator theorems and Turán-type results for planar intersection graphs
• A new technique for analyzing substructures in arrangements of piecewise linear surfaces
• On extremal problems of graphs and generalized graphs
• A semi-algebraic version of Zarankiewicz's problem
• A Separator Theorem for String Graphs and its Applications
• Über ein Problem von K. Zarankiewicz
• On planar intersection graphs with forbidden subgraphs
• CUTTINGS AND APPLICATIONS
• On Range Searching with Semialgebraic Sets. II
• Applications of a New Separator Theorem for String Graphs
• On Graphs that do not Contain a Thomsen Graph
• On a problem of K. Zarankiewicz