Fix integers $1\le t<k$ and $\lambda\ge 1$. There exists an integer $v_0=v_0(t,k,\lambda)$ such that for every $v\ge v_0$, a $t-(v,k,\lambda)$ design exists if and only if the divisibility conditions hold.
Knowledge Status
Discrete MathematicsCombinatorics
Discussion
Keevash Existence Theorem for Designs records a standard result in combinatorial design theory. It is used to build, count, or constrain finite designs such as block designs, Latin squares, finite planes, Steiner systems, and related codes.