A Proof of the $(n,k,t)$-Conjectures

Stacie Baumann, Joseph Briggs

An \emph{$(n,k,t)$-graph} is a graph on $n$ vertices in which every set of $k$ vertices contains a clique on $t$ vertices. Turán's Theorem, rephrased in terms of graph complements,…