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 ) .