Problem

Source:

Tags: combinatorics



A1,A2,...,Am are subsets of X and we have |Ai|=mk (m,k natural numbers) prove that we can separate X into k sets such that every set has at least one member of each Ai.