Author:
GYŐRI ERVIN,LEMONS NATHAN
Abstract
Recently, the authors gave upper bounds for the size of 3-uniform hypergraphs avoiding a given odd cycle using the definition of a cycle due to Berge. In the present paper we extend this bound to m-uniform hypergraphs (for all m ≥ 3), as well as m-uniform hypergraphs avoiding a cycle of length 2k. Finally we consider non-uniform hypergraphs avoiding cycles of length 2k or 2k + 1. In both cases we can bound |h| by O(n1+1/k) under the assumption that all h ∈ ε() satisfy |h| ≥ 4k2.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference7 articles.
1. Triangle-Free Hypergraphs
2. Cycles of even length in graphs
3. Pentagons vs. triangles
4. [6] Győri E. and Lemons N. 3-uniform hypergraphs avoiding a given odd cycle. Combinatorica, to appear.
5. Odd cycles and Θ-cycles in hypergraphs
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献