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

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

Jozsef Solymosi This is my paper

classification math.CO

keywords hypergraphslinearnumbertimesboundconstructiondensegrids

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

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.