The Turán number of Berge book hypergraphs

DOI10.1137/22M1474266MaRDI QIDQ6644117

Dániel Gerbner

Publication date: 27 November 2024

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

zbMATH Keywords

Turán numberBerge hypergraphFan graphbook graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On the cover Turán number of Berge hypergraphs
• General lemmas for Berge-Turán hypergraph problems
• A note on the uniformity threshold for Berge hypergraphs
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Avoiding long Berge cycles
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• Counting copies of a fixed subgraph in \(F\)-free graphs
• On the weight of Berge-\(F\)-free hypergraphs
• Hypergraphs with no cycle of a given length
• Triangle-Free Hypergraphs
• Extremal Results for Berge Hypergraphs
• On the structure of linear graphs
• Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
• Many \(T\) copies in \(H\)-free graphs
• Book free 3-uniform hypergraphs

This page was built for publication: The Turán number of Berge book hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644117)