  A $k$-book in a hypergraph consists of $k$ Berge triangles sharing a common
edge. In this paper we prove that the number of the hyperedges in a
$k$-book-free 3-uniform hypergraph on $n$ vertices is at most
$\frac{n^2}{8}(1+o(1))$.
