Spectral Extremal Results for Hypergraphs

Yuan Hou, An Chang, Joshua Cooper

Let $F$ be a graph. A hypergraph is called Berge $F$ if it can be obtained by replacing each edge in $F$ by a hyperedge containing it. Given a family of graphs $\mathcal{F}$, we sa…