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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
