Journal of Graph Theory Дискретная математика и комбинаторика
On the Turán Number of the G3×3 in Linear Hypergraphs
Аннотация
ABSTRACT We construct dense 3‐uniform linear hypergraphs without grids. This improves the known lower bound for their Turán number. We also discuss some related problems.