On the cover Turán number of Berge hypergraphs

DOI10.1016/J.EJC.2021.103416MaRDI QIDQ1979446zbMATH OpenOpenAlexFDO

Authors Linyuan Lu, Zhiyu Wang

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

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

Abstract: For a fixed set of positive integers $R$, we say $mathcalH$ is an $R$-uniform hypergraph, or $R$-graph, if the cardinality of each edge belongs to $R$. For a graph $G=(V,E)$, a hypergraph $mathcalH$ is called a Berge-$G$, denoted by $BG$, if there exists a bijection $f:E(G)oE(mathcalH)$ such that for every $einE(G)$, $esubseteqf(e)$. In this paper, we define a variant of Tur'an number in hypergraphs, namely the cover Tur'an number, denoted as $hat{ex}_R(n,G)$, as the maximum number of edges in the shadow graph of a Berge-$G$ free $R$-graph on $n$ vertices. We show a general upper bound on the cover Tur'an number of graphs and determine the cover Tur'an density of all graphs when the uniformity of the host hypergraph equals to $3$.

Recommendations

• On the cover Ramsey number of Berge hypergraphs
• Turán numbers for Berge-hypergraphs and related extremal problems
• The Turán number of Berge-matching in hypergraphs
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• General lemmas for Berge-Turán hypergraph problems

Cites work

• 3-uniform hypergraphs avoiding a given odd cycle
• A note on Ramsey numbers for Berge-\(G\) hypergraphs
• An Erdős-Gallai type theorem for uniform hypergraphs
• Avoiding long Berge cycles
• Exponential lower bound for Berge-Ramsey problems
• Extremal results for Berge hypergraphs
• General lemmas for Berge-Turán hypergraph problems
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• Hypergraph extensions of the Erdős-Gallai theorem
• Hypergraphs with no cycle of a given length
• Many \(T\) copies in \(H\)-free graphs
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• On a problem of K. Zarankiewicz
• On Berge-Ramsey problems
• On Hamiltonian Berge cycles in [3]-uniform hypergraphs
• On the cover Ramsey number of Berge hypergraphs
• On the structure of linear graphs
• Ramsey numbers of Berge-hypergraphs and related structures
• Ramsey problems for Berge hypergraphs
• The 3-colour Ramsey number of a 3-uniform Berge cycle
• The structure of hypergraphs without long Berge cycles
• Triangle-Free Hypergraphs
• Turán numbers for Berge-hypergraphs and related extremal problems
• Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs

Cited in

(7)

• Turán numbers for Berge-hypergraphs and related extremal problems
• On Hamiltonian Berge cycles in [3]-uniform hypergraphs
• A note on the uniformity threshold for Berge hypergraphs
• Turán numbers of complete 3-uniform Berge-hypergraphs
• The Turán number of Berge book hypergraphs
• On Turán-type problems and the abstract chromatic number
• On the cover Ramsey number of Berge hypergraphs

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

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