Zarankiewicz’s problem for semilinear hypergraphs
A bipartite graph $H = \left (V_1, V_2; E \right )$ with $\lvert V_1\rvert + \lvert V_2\rvert = n$ is semilinear if $V_i \subseteq \mathbb {R}^{d_i}$ for some $d_i$ and the edge relation E consists of the pairs of points $(x_1, x_2) \in V_1 \times V_2$ satisfying a...
Main Authors: | Abdul Basit, Artem Chernikov, Sergei Starchenko, Terence Tao, Chieu-Minh Tran |
---|---|
Format: | Article |
Language: | English |
Published: |
Cambridge University Press
2021-01-01
|
Series: | Forum of Mathematics, Sigma |
Subjects: | |
Online Access: | https://www.cambridge.org/core/product/identifier/S2050509421000529/type/journal_article |
Similar Items
-
Generic Stability Independence and Treeless Theories
by: Itay Kaplan, et al.
Published: (2024-01-01) -
On n-dependent groups and fields II
by: Artem Chernikov, et al.
Published: (2021-01-01) -
Dissecting a square into congruent polygons
by: Hui Rao, et al.
Published: (2020-06-01) -
On the kernel of the $(\kappa ,a)$ -Generalized fourier transform
by: Dmitry Gorbachev, et al.
Published: (2023-01-01) -
All finite sets are Ramsey in the maximum norm
by: Andrey Kupavskii, et al.
Published: (2021-01-01)