Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949840 | Discrete Applied Mathematics | 2017 | 7 Pages |
Abstract
We study the maximum number of hyperedges in a 3-uniform hypergraph on n vertices that does not contain a Berge cycle of a given length â. In particular we prove that the upper bound for C2k+1-free hypergraphs is of the order O(k2n1+1/k), improving the upper bound of GyÅri and Lemons (2012) by a factor of Î(k2). Similar bounds are shown for linear hypergraphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Zoltán Füredi, Lale Ãzkahya,