Constructing dense grid-free linear $3$-graphs

DOI10.1090/proc/15673zbMath1477.05129arXiv2010.14469OpenAlexW3168603608MaRDI QIDQ5164032

Lior Gishboliner, Asaf Shapira

Publication date: 9 November 2021

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.14469

zbMATH Keywords

hypergraph regularityBrown-Erdős-Sós conjecturecores in hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30)

Related Items

The linear Turán number of small triple systems or why is the wicket interesting? ⋮ The Turán number of the grid ⋮ Local-vs-global combinatorics ⋮ A new bound for the Brown-Erdős-Sós problem

Cites Work

• Unnamed Item
• Unnamed Item
• Small cores in 3-uniform hypergraphs
• Uniform hypergraphs containing no grids
• An extension of the Ruzsa-Szemerédi theorem
• Sparse hypergraphs: new bounds and constructions
• Turán and Ramsey numbers in linear triple systems
• On the existence of triangulated spheres in 3-graphs, and related problems
• Sparse Hypergraphs with Applications to Coding Theory