Abstract

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 n28(1+o(1)).

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call