A note on the maximum size of Berge-\( C_4\)-free hypergraphs

DOI10.1016/j.disc.2020.112262zbMath1460.05133arXiv2001.01184OpenAlexW3117220596MaRDI QIDQ2659177

Beka Ergemlidze

Publication date: 25 March 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

extremal hypergraphsTuran problemBerge 4-cyclesum of sizes of hyperedges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (1)

Forbidding \(K_{2,t}\) traces in triple systems

Cites Work

• Hypergraphs with no cycle of length 4
• Extremal Results for Berge Hypergraphs
• On a problem of K. Zarankiewicz
• Unnamed Item

This page was built for publication: A note on the maximum size of Berge-\( C_4\)-free hypergraphs