Name
Abstract | ||
|---|---|---|
For a graph F, a hypergraph H is a Berge copy of F (or a Berge-F in short), if there is a bijection f:E(F)→E(H) such that for each e∈E(F) we have e⊂f(e). A hypergraph is Berge-F-free if it does not contain a Berge copy of F. We denote the maximum number of hyperedges in an n-vertex r-uniform Berge-F-free hypergraph by exr(n,Berge-F). |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ejc.2020.103082 | European Journal of Combinatorics |
DocType | Volume | ISSN |
Journal | 86 | 0195-6698 |
Citations | PageRank | References |
2 | 0.42 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dániel Gerbner | 1 | 46 | 21.61 |
| Abhishek Methuku | 2 | 5 | 0.86 |
| Cory Palmer | 3 | 44 | 10.33 |