Skip to main content
1 of 4
Or Meir
  • 419
  • 2
  • 8

Minimal family of k-sets containing all t-sets

Let $n \ge k \ge t \in \mathbb{N}$, and consider a universe $U$ of size $n$. Let $\mathcal{F}$ be a family of $k$-subsets of $U$, such that every $t$-subset of $U$ is contained in at least one member of $\mathcal{F}$. My question is: How small can $\mathcal{F}$ be? In other words, what is the smallest possible size of $\mathcal{F}$, in terms of $n,k,t$? Is it a known theorem?

Or Meir
  • 419
  • 2
  • 8