In this problem, there's some giant set U.  There's also a list of subsets S1, S2, S3, ..., Sn and an integer k.  The goal is to determine whether there is a list of k subsets that are pairwise disjoint, meaning none of them contain the same element.

I couldn't find a good video.