Turán problems for Berge-\((k, p)\)-fan hypergraph

DOI10.1007/s11401-021-0272-7zbMath1470.05079OpenAlexW3188963412MaRDI QIDQ2047221

Zhenyu Ni, Erfang Shan, Li-ying Kang

Publication date: 19 August 2021

Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11401-021-0272-7

zbMATH Keywords

Turán numberBerge-hypergraph

Mathematics Subject Classification ID

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

Cites Work

• 3-uniform hypergraphs avoiding a given odd cycle
• Hypergraph extensions of the Erdős-Gallai theorem
• A method in graph theory
• Extremal graphs for intersecting cliques
• General lemmas for Berge-Turán hypergraph problems
• Turán numbers for Berge-hypergraphs and related extremal problems
• Maximizing the number of cliques in graphs with given matching number
• Generalized Turán problems for disjoint copies of graphs
• Extremal Finite Set Theory
• 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: Turán problems for Berge-\((k, p)\)-fan hypergraph