Book free 3-Uniform Hypergraphs
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)).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.