Karen Gunderson

For any $r\geq 2$, an $r$-uniform hypergraph $\mathcal{H}$, and integer $n$, the \emph{Tur\'{a}n number} for $\mathcal{H}$ is the maximum number of hyperedges in any $r$-uniform hypergraph on $n$ vertices containing no copy of $\mathcal{H}$. While...

For any \(r\geq 2\), an \(r\)-uniform hypergraph \(\mathcal{H}\), and integer \(n\), the Turán number for \(\mathcal{H}\) is the maximum number of hyperedges in any \(r\)-uniform hypergraph on \(n\) vertices containing no copy of \(\mathcal{H}\)...