On the Tur\'an number of the $G_{3\times 3}$ in linear hypergraphs

arxiv: 2504.16973 · v3 · pith:DTXYBKX4 · submitted 2025-04-23 · math.CO

On the Tur\'an number of the G_(3times 3) in linear hypergraphs

Jozsef Solymosi This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:DTXYBKX4 record.json open to challenge →

classification math.CO

keywords hypergraphslinearnumbertimesboundconstructiondensegrids

0 comments

read the original abstract

We show a construction for dense 3-uniform linear hypergraphs without $3\times 3$ grids, improving the lower bound on its Tur\'an number.

This paper has not been read by Pith yet.