Before revision:  We prove that the number of 3-sized hyperedges is bounded by O  (n^2) and that this bound is tight.
After revision:  We prove that the number of t-hyperedges is bounded by O (n^2) and that this bound is tight.