加载中…
A partial partition of an -element set is a collection of pairwise disjoint -element subsets. It is proved that, if is large enough, one can find such partial partitions in such a way that if and are distinct classes in one of the partial partitions, and are distinct classes in another one, then one of the intersections has size at most .

生成讲解博客的中文版本

生成AI智能校验的中文版本