On the Tur\'an number of the $G_{3\times 3}$ in linear hypergraphs
Combinatorics
2025-07-29 v3
Abstract
We show a construction for dense 3-uniform linear hypergraphs without grids, improving the lower bound on its Tur\'an number.
Cite
@article{arxiv.2504.16973,
title = {On the Tur\'an number of the $G_{3\times 3}$ in linear hypergraphs},
author = {Jozsef Solymosi},
journal= {arXiv preprint arXiv:2504.16973},
year = {2025}
}