For r-partite intersection hypergraphs of axis-parallel boxes in R^d, the paper proves the sharp bound O_{d,r}(t n^{r-1} (log n / log log n)^{d-1}), and for pseudo-discs, O_r(t n^{r-1} (log n)^{r-2}).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects
For r-partite intersection hypergraphs of axis-parallel boxes in R^d, the paper proves the sharp bound O_{d,r}(t n^{r-1} (log n / log log n)^{d-1}), and for pseudo-discs, O_r(t n^{r-1} (log n)^{r-2}).