Book free $3$-Uniform Hypergraphs

Authors:
  • DGDebarun Ghosh
    Debarun Ghosh
  • EGErvin Győri
    Ervin Győri
  • JNJudit Nagy-György
    Judit Nagy-György
  • APAddisu Paulos
    Addisu Paulos
  • CXChuanqi Xiao
    Chuanqi Xiao
  • OZOscar Zamora
    Oscar Zamora

Abstract
One of the first problems in extremal graph theory was the maximum number of edges that a triangle-free graph can have. Mantel solved this, which built the foundations of what we know as extremal graph theory. The natural progression was to ask the maximum number of edges in a $k$-book free graph. A $k$-book, denoted by $B_k$, is $k$ triangles sharing a common edge. In the early 2000s, Gy\H{o}ri \cite{gyori1} solved the hypergraph analog of the maximum number of hyperedges in a triangle-free hypergraph. In a hypergraph, $k$-book denotes $k$ Berge triangles sharing a common edge. Let $\text{ex}_3(n,\mathcal{F})$ denote the maximum number of hyperedges in a Berge-$\mathcal{F}$-free hypergraph on $n$ vertices. In this paper, we prove $\text{ex}_3(n,B_k)=\frac{n^2}{8}(1+o(1))$.