Hypergraph based Berge hypergraphs

DOI10.1007/S00373-021-02419-1MaRDI QIDQ2062896zbMATH OpenOpenAlexFDO

Authors Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, Cory Palmer

Publication date 3 January 2022

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Berge hypergraphssypergraph Turán problems

Mathematics Subject Classification ID

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

Abstract: Fix a hypergraph $mathcalF$. A hypergraph $mathcalH$ is called a {it Berge copy of $mathcalF$} or {it Berge-$mathcalF$} if we can choose a subset of each hyperedge of $mathcalH$ to obtain a copy of $mathcalF$. A hypergraph $mathcalH$ is {it Berge-$mathcalF$-free} if it does not contain a subhypergraph which is Berge copy of $mathcalF$. This is a generalization of the usual, graph based Berge hypergraphs, where $mathcalF$ is a graph. In this paper, we study extremal properties of hypergraph based Berge hypergraphs and generalize several results from the graph based setting. In particular, we show that for any $r$-uniform hypregraph $mathcalF$, the sum of the sizes of the hyperedges of a (not necessarily uniform) Berge-$mathcalF$-free hypergraph $mathcalH$ on $n$ vertices is $o(n^r)$ when all the hyperedges of $mathcalH$ are large enough. We also give a connection between hypergraph based Berge hypergraphs and generalized hypergraph Tur'an problems.

Recommendations

• General lemmas for Berge-Turán hypergraph problems
• Extremal results for Berge hypergraphs
• Turán numbers for Berge-hypergraphs and related extremal problems
• On saturation of Berge hypergraphs
• Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs

Cites work

• A note on Ramsey numbers for Berge-\(G\) hypergraphs
• A note on the Turán number of a Berge odd cycle
• A survey of Turán problems for expansions
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• Avoiding long Berge cycles
• Counting copies of a fixed subgraph in F-free graphs
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• Extremal Finite Set Theory
• Extremal results for Berge hypergraphs
• Forbidden Berge hypergraphs
• General lemmas for Berge-Turán hypergraph problems
• scientific article; zbMATH DE number 3843786 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• Hypergraph extensions of the Erdős-Gallai theorem
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Hypergraphs with no cycle of a given length
• Linearity of saturation for Berge hypergraphs
• Many \(T\) copies in \(H\)-free graphs
• On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
• On an extremal hypergraph problem of Brown, Erdős and Sós
• On hypergraphs of girth five
• On the weight of Berge-\(F\)-free hypergraphs
• Ramsey numbers of Berge-hypergraphs and related structures
• Ramsey problems for Berge hypergraphs
• Saturation of Berge hypergraphs
• Some extremal results on complete degenerate hypergraphs
• The extremal \(p\)-spectral radius of Berge hypergraphs
• The hypergraph regularity method and its applications
• 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

(8)

• General lemmas for Berge-Turán hypergraph problems
• A note on the uniformity threshold for Berge hypergraphs
• On the weight of Berge-\(F\)-free hypergraphs
• Turán number of bipartite graphs with no \(K_{t,t}\)
• \(t\)-wise Berge and \(t\)-heavy hypergraphs
• Hypergraphs with Few Berge Paths of Fixed Length between Vertices
• Extremal results for Berge hypergraphs
• Induced Turán problems and traces of hypergraphs

This page was built for publication: Hypergraph based Berge hypergraphs

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