On the cover Turán number of Berge hypergraphs

DOI10.1016/J.EJC.2021.103416zbMath1471.05048arXiv1903.12082OpenAlexW3191378508MaRDI QIDQ1979446

Zhiyu Wang, Linyuan Lu

Publication date: 2 September 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(R\)-uniform hypergraphBerge-\(G\) hypergraphcover Turán number

Mathematics Subject Classification ID

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

Related Items (2)

A note on the uniformity threshold for Berge hypergraphs ⋮ The Turán number of Berge book hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• 3-uniform hypergraphs avoiding a given odd cycle
• On the cover Ramsey number of Berge hypergraphs
• An Erdős-Gallai type theorem for uniform hypergraphs
• A note on Ramsey numbers for Berge-\(G\) hypergraphs
• General lemmas for Berge-Turán hypergraph problems
• The structure of hypergraphs without long Berge cycles
• Turán numbers for Berge-hypergraphs and related extremal problems
• On Hamiltonian Berge cycles in [3-uniform hypergraphs]
• Exponential lower bound for Berge-Ramsey problems
• On Berge-Ramsey problems
• Ramsey numbers of Berge-hypergraphs and related structures
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• Avoiding long Berge cycles
• Hypergraph Extensions of the Erdős-Gallai Theorem
• Hypergraphs with No Cycle of a Given Length
• The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle
• Triangle-Free Hypergraphs
• Ramsey Problems for Berge Hypergraphs
• Extremal Results for Berge Hypergraphs
• On a problem of K. Zarankiewicz
• 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

This page was built for publication: On the cover Turán number of Berge hypergraphs