For even $t$ and an $n$-set $X$, an $(n,t)$-splitting system is a family ${\mathbb{B}} \subseteq 2^X$ with the property that for each subset $Y \in {X \choose t}$, there exists $B \in \mathbb{B}$ such that $|B \cap Y| = t/2$. The problem of interest is to determine the minimum size of such splitting systems. We show that any $(n,t)$-splitting system has size at least of order $t$, improving the previous lower bound of $\sqrt t$ while the best known upper bound is of order $t^{3/2}$.

翻译：暂无翻译