Zarankiewicz's problem via $\epsilon$-t-nets
arxiv(2023)
摘要
The classical Zarankiewicz's problem asks for the maximum number of edges in
a bipartite graph on $n$ vertices which does not contain the complete bipartite
graph $K_{t,t}$. In one of the cornerstones of extremal graph theory,
K\H{o}v\'ari S\'os and Tur\'an proved an upper bound of $O(n^{2-\frac{1}{t}})$.
In a celebrated result, Fox et al. obtained an improved bound of
$O(n^{2-\frac{1}{d}})$ for graphs of VC-dimension $d$ (where $d更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要