Hypergraphs with no cycle of length 4

Using the definition of cycles in hypergraphs due to Berge, we show that a hypergraph H containing no 4-cycles satisfies @?"h"@?"E"("H")(|h|-3)=O(n^3^/^2).

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

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

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

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

[5]  Edward A. Bender,et al.  A Discontinuity in the Distribution of Fixed Point Sums , 2003, Electron. J. Comb..