Abstract
It is proved that one can choose disjoint pairs of k-element subsets of an n-element set in such a way that the unions of the pairs are all different, supposing that n > n(k).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have