Abstract | ||
---|---|---|
We generalize a result of Balister, Győri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an n-vertex r-uniform connected hypergraph with the maximum number of hyperedges, without a k-Berge-path, where n≥Nk,r, k≥2r+13>17. |
Year | DOI | Venue |
---|---|---|
2021 | 10.1016/j.ejc.2021.103353 | European Journal of Combinatorics |
DocType | Volume | ISSN |
Journal | 96 | 0195-6698 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ervin Györi | 1 | 88 | 21.62 |
Nika Salia | 2 | 0 | 0.34 |
Oscar Zamora | 3 | 1 | 1.07 |