We show a construction for dense 3-uniform linear hypergraphs without
$3\times 3$ grids, improving the lower bound on its Tur\’an number.
Cet article explore les excursions dans le temps et leurs implications.
Télécharger PDF:
Papiers
On the Turán number of the $G_{3\times 3}$ in linear hypergraphs
