1 problem

Let $k>r\geq 3$ and let an $r$-uniform hypergraph be a hypergraph whose edges have size $r$. A $k$-hyperclique is a set of $k$ vertices such that every $r$-subset is an edge. The L…