Abstract | ||
---|---|---|
In this note we obtain upper bounds on the number of hyperedges in 3-uniform hypergraphs not containing a Berge cycle of given odd length. We improve the bound given by Furedi and Ozkahya in 2017. The result follows from a more general theorem. We also obtain some new results for Berge cliques. |
Year | Venue | DocType |
---|---|---|
2021 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
79 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 12 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dániel Gerbner | 1 | 46 | 21.61 |