Zarankiewicz’s problem for semilinear hypergraphs
DOI10.1017/fms.2021.52zbMath1473.05133arXiv2009.02922OpenAlexW3198368056WikidataQ112628822 ScholiaQ112628822MaRDI QIDQ5154785
No author found.
Publication date: 5 October 2021
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.02922
Hypergraphs (05C65) Enumeration in graph theory (05C30) Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10) Classification theory, stability, and related concepts in model theory (03C45) Model theory of ordered structures; o-minimality (03C64) Combinatorial complexity of geometric structures (52C45)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Zarankiewicz problem for intersection hypergraphs
- Zarankiewicz's problem for semi-algebraic hypergraphs
- Extremal problems in discrete geometry
- Separator theorems and Turán-type results for planar intersection graphs
- Regularity lemma for distal structures
- Cutting lemma and Zarankiewicz's problem in distal structures
- On the chromatic number of regular graphs of matrix algebras
- On extremal problems of graphs and generalized graphs
- A semi-algebraic version of Zarankiewicz's problem
- Weakly one-based geometric theories
- Separation Dimension of Bounded Degree Graphs
- A trichotomy theorem for o-minimal structures
- Additive reducts of real closed fields
- An o-minimal Szemerédi–Trotter theorem
- Model Theory
- Model-theoretic Elekes–Szabó in the strongly minimal case
- Trivial Stable Structures with Non-Trivial Reducts
- On a problem of K. Zarankiewicz
- Turán-type results for intersection graphs of boxes
This page was built for publication: Zarankiewicz’s problem for semilinear hypergraphs