We show a construction for dense 3-uniform linear hypergraphs without $3\times 3$ grids, improving the lower bound on its Turán number.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。