The Turán number of Berge hypergraphs with stable properties

DOI10.1016/j.disc.2023.113737zbMath1525.05088MaRDI QIDQ6056469

Erfang Shan, Li-ying Kang, Yi-Sai Xue

Publication date: 30 October 2023

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

zbMATH Keywords

hypergraphTurán numberBerge hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• A method in graph theory
• General lemmas for Berge-Turán hypergraph problems
• Maximizing the number of cliques in graphs with given matching number
• The generalized Turán number of spanning linear forests
• The Turán number of Berge-matching in hypergraphs
• The formula for Turán number of spanning linear forests
• Counting copies of a fixed subgraph in \(F\)-free graphs
• A variation of a theorem by Pósa
• The Turán Number of Berge K_4 in Triple Systems
• The Turán Number of Berge-$K_4$ in 3-Uniform Hypergraphs
• Extremal Results for Berge Hypergraphs
• Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: The Turán number of Berge hypergraphs with stable properties