On the Tur\'an number of the G_(3times 3) in linear hypergraphs
classification
🧮 math.CO
keywords
hypergraphslinearnumbertimesboundconstructiondensegrids
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.