We also consider larger uniformity and determine the largestnumber of Berge B t -free r-uniform hypergraphs besides an additive term o(n 2 ). Weobtain a similar bound if the Berge t-fan (t triangles sharing a vertex) is forbidden.1 IntroductionGiven a graph G and a hypergraph H, we ...