On Zarankiewicz's problem for intersection hypergraphs of geometric objects

DOI10.4230/LIPICS.SOCG.2025.33MaRDI QIDQ7312679zbMATH OpenFDO

Authors Timothy M. Chan, Chaya Keller, Shakhar Smorodinsky

Publication date 11 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2025.33

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• A semi-algebraic version of Zarankiewicz's problem
• Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
• Coloring lines and Delaunay graphs with respect to boxes
• scientific article; zbMATH DE number 3841905 (Why is no real title available?)
• Lower bounds for orthogonal range searching: I. The reporting case
• On a problem of K. Zarankiewicz
• On extremal problems of graphs and generalized graphs
• On Graphs that do not Contain a Thomsen Graph
• On the number of incidences when avoiding an induced biclique in geometric settings
• On the Zarankiewicz problem for graphs with bounded VC-dimension
• Recent developments in extremal combinatorics: Ramsey and Turán type problems
• Reporting points in halfspaces
• Representation complexities of semialgebraic graphs
• Turán-type results for intersection graphs of boxes
• Zarankiewicz's problem for semi-algebraic hypergraphs
• Zarankiewicz's problem for semilinear hypergraphs
• Zarankiewicz's problem via -t-nets

This page was built for publication: On Zarankiewicz's problem for intersection hypergraphs of geometric objects

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