The Turán number of Berge-matching in hypergraphs
From MaRDI portal
Publication:2142638
DOI10.1016/J.DISC.2022.112901zbMATH Open1490.05119OpenAlexW4221100288MaRDI QIDQ2142638
Zhenyu Ni, Erfang Shan, Li-ying Kang
Publication date: 27 May 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.112901
Cites Work
- Hypergraph extensions of the Erdős-Gallai theorem
- A method in graph theory
- General lemmas for Berge-Turán hypergraph problems
- Maximizing the number of cliques in graphs with given matching number
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Hypergraphs with No Cycle of a Given Length
- 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
Related Items (3)
The Turán number of Berge hypergraphs with stable properties ⋮ A stability result for Berge-\( K_{3 , t}r\)-graphs and its applications ⋮ A note on stability results for Berge-\( K_{s , t}\) hypergraphs
This page was built for publication: The Turán number of Berge-matching in hypergraphs
