... D.MubayiandV.R¨odl, On the Tur´an number of triple systems, J. Combin. Theory (A)100 (2002), 135–152. the electronic journal of combinatorics 10 (2003), #R18 73 Proof of Theorem 1 The proof consists of three ... hypergraph. The degrees of any two vertices of H differ by at most n −2. Indeed, otherwise we candelete the vertex with the smaller degree and duplicate the other, strictly increasing the size of H. ... mayapply the Moon-Moser’s extension of Tur´an’s theorem [6], that the number of trianglesk3(G)ofann-vertex e-edge graph G is at least e(4e − n2)/(3n). The convexity of thisfunction implies for...