3-uniform hypergraphs avoiding a given odd cycle

We give upper bounds for the size of 3-uniform hypergraphs avoiding a given odd cycle using the definition of a cycle due to Berge. In particular, we show that a 3-uniform hypergraph containing no cycle of length 2k+1 has less than 4k4n1+1/k+O(n) edges. Constructions show that these bounds are best possible (up to constant factor) for k=1,2,3, 5.

[1]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[2]  M. Simonovits,et al.  Cycles of even length in graphs , 1974 .

[3]  Hao Li,et al.  The Maximum Number of Triangles in C2k+1-Free Graphs , 2012, Combinatorics, Probability and Computing.

[4]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[5]  Béla Bollobás,et al.  Pentagons vs. triangles , 2008, Discret. Math..

[6]  P. Erdös,et al.  On the structure of linear graphs , 1946 .

[7]  Felix Lazebnik,et al.  On Hypergraphs of Girth Five , 2003, Electron. J. Comb..

[8]  P. Erdos,et al.  On maximal paths and circuits of graphs , 1959 .

[9]  Ervin Györi,et al.  Triangle-Free Hypergraphs , 2006, Combinatorics, Probability and Computing.