Extremal results for Berge hypergraphs
From MaRDI portal
Abstract: Let be a graph and be a hypergraph both on the same vertex set. We say that a hypergraph is a emph{Berge}- if there is a bijection such that for we have . This generalizes the established definitions of "Berge path" and "Berge cycle" to general graphs. For a fixed graph we examine the maximum possible size (i.e. the sum of the cardinality of each edge) of a hypergraph with no Berge- as a subhypergraph. In the present paper we prove general bounds for this maximum when is an arbitrary graph. We also consider the specific case when is a complete bipartite graph and prove an analogue of the KH ov'ari-S'os-Tur'an theorem.
Recommendations
Cites work
- 3-uniform hypergraphs avoiding a given odd cycle
- An anti-Ramsey theorem
- An Erdős-Gallai type theorem for uniform hypergraphs
- Anti-Ramsey theory on complete bipartite graphs
- Cycles of even length in graphs
- Exact solution of the hypergraph Turán problem for k-uniform linear paths
- scientific article; zbMATH DE number 3825881 (Why is no real title available?)
- Hypergraph extensions of the Erdős-Gallai theorem
- Hypergraph Turán numbers of linear cycles
- Hypergraphs with no cycle of a given length
- Hypergraphs with no cycle of length 4
- Linear trees in uniform hypergraphs
- On 3-uniform hypergraphs without a cycle of a given length
- On a problem of K. Zarankiewicz
- On hypergraphs of girth five
- On maximal paths and circuits of graphs
- Pentagons vs. triangles
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Rainbow Turán Problems
- Triangle-Free Hypergraphs
- Turán Problems and Shadows III: Expansions of Graphs
- Turán problems and shadows. I: Paths and cycles
- Turán problems and shadows. II: Trees
Cited in
(76)- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- A note on Ramsey numbers for Berge-\(G\) hypergraphs
- A conjecture of Berge about linear hypergraphs and Steiner systems \(S(2,4,v)\)
- On the cover Turán number of Berge hypergraphs
- General lemmas for Berge-Turán hypergraph problems
- Turán numbers for Berge-hypergraphs and related extremal problems
- Saturation of Berge hypergraphs
- A note on saturation for Berge-\(G\) hypergraphs
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs
- Exponential lower bound for Berge-Ramsey problems
- Turán problems for Berge-\((k, p)\)-fan hypergraph
- Spectral extremal results for hypergraphs
- Hypergraph based Berge hypergraphs
- Unified approach to the generalized Turán problem and supersaturation
- Generalized Turán problems for complete bipartite graphs
- Multicolor Ramsey numbers for Berge cycles
- A linear hypergraph extension of Turán's theorem
- On saturation of Berge hypergraphs
- Turán numbers for hypergraph star forests
- The Turán number of Berge-matching in hypergraphs
- A note on the uniformity threshold for Berge hypergraphs
- Extremal problems for the \(p\)-spectral radius of Berge hypergraphs
- 3-uniform hypergraphs without a cycle of length five
- On Berge-Ramsey problems
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Generalized Turán problems for even cycles
- Saturation number of Berge stars in random hypergraphs
- A linear hypergraph extension of the bipartite Turán problem
- The extremal \(p\)-spectral radius of Berge hypergraphs
- Ramsey numbers of Berge-hypergraphs and related structures
- Avoiding long Berge cycles
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Counting copies of a fixed subgraph in F-free graphs
- Partitioning the power set of \([n]\) into \(C_k\)-free parts
- Generalized Turán problems for disjoint copies of graphs
- On the weight of Berge-\(F\)-free hypergraphs
- Linearity of saturation for Berge hypergraphs
- A note on the maximum size of Berge-\( C_4\)-free hypergraphs
- Forbidding \(K_{2,t}\) traces in triple systems
- The Turán Number of Berge K₄ in Triple Systems
- A note on the Turán number of a Berge odd cycle
- Avoiding long Berge cycles: the missing cases k=r+1 and k=r+2
- Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
- \(t\)-wise Berge and \(t\)-heavy hypergraphs
- The Turán number of Berge-K₄ in 3-uniform hypergraphs
- Forbidden Berge hypergraphs
- Ramsey problems for Berge hypergraphs
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
- The Turán number of Berge hypergraphs with stable properties
- Induced Turán problems and traces of hypergraphs
- On non-degenerate Berge-Turán problems
- On Ramsey numbers of 3-uniform Berge cycles
- Saturation numbers for Berge cliques
- Stability of extremal connected hypergraphs avoiding Berge-paths
- Linear saturation numbers of Berge-C₃ and Berge-C₄
- A stability result for Berge-\( K_{3 , t}r\)-graphs and its applications
- Ramsey numbers of Berge-hypergraphs and related structures
- Turán numbers of general star forests in hypergraphs
- The Turán number of Berge book hypergraphs
- On non-degenerate Turán problems for expansions
- A note on stability results for Berge-\( K_{s , t}\) hypergraphs
- The Turán number of Berge-linear forests in hypergraphs
- The extremal problems for the spectral radius of hypergraphs without the Berge-graphs
- On forbidding graphs as traces of hypergraphs
- The spectral radius of the hypergraphs without the expansion of P₃ or Berge-P_k
- Some stability results for linear forests in hypergraphs
- Counting multiple graphs in generalized Turán problems
- Spectral bipartite Turán problems on linear hypergraphs
- The p-spectral radius of Berge-keyring hypergraphs
- Turán problem for Berge disjoint cycles in hypergraphs
- Bounds on the spectral radii of Berge C₅-free linear r-graphs
- Hypergraph extensions of the Erdős-Gallai theorem
- On the cover Ramsey number of Berge hypergraphs
This page was built for publication: Extremal results for Berge hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371028)
