Turán numbers for Berge-hypergraphs and related extremal problems

Cory Palmer, Michael Tait, Craig Timmons +1

Let $F$ be a graph. We say that a hypergraph $H$ is a {\it Berge}-$F$ if there is a bijection $f:E(F)\to E(H)$ such that $e\subseteq f(e)$ for every $e\in E(F)$. Note…