On the Tur\'an number of the G3× 3 in linear hypergraphs
Abstract
We show a construction for dense 3-uniform linear hypergraphs without 3× 3 grids, improving the lower bound on its Tur\'an number.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.