Name
Abstract | ||
|---|---|---|
Fix a hypergraph F. A hypergraph H is called a Berge copy of F or Berge-F if we can choose a subset of each hyperedge of H to obtain a copy of F. A hypergraph H is Berge-F-free if it does not contain a subhypergraph which is Berge copy of F. This is a generalization of the usual, graph-based Berge hypergraphs, where F 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 hypergraph F, the sum of the sizes of the hyperedges of a (not necessarily uniform) Berge-F-free hypergraph H on n vertices is o(n(r)) when all the hyperedges of H are large enough. We also give a connection between hypergraph based Berge hypergraphs and generalized hypergraph Turan problems. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s00373-021-02419-1 | GRAPHS AND COMBINATORICS |
Keywords | DocType | Volume |
Berge hypergraphs, Sypergraph Turan problems | Journal | 38 |
Issue | ISSN | Citations |
1 | 0911-0119 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balko Martin | 1 | 0 | 0.34 |
| Dániel Gerbner | 2 | 46 | 21.61 |
| Dong Yeap Kang | 3 | 11 | 3.97 |
| Younjin Kim | 4 | 7 | 2.64 |
| Cory Palmer | 5 | 44 | 10.33 |