1 problem

Let $k$ and $t$ be fixed, and let $D=\binom{k}{t}-1$. Consider a covering produced by the random greedy algorithm, and define its density as the number of blocks divided by the asy…