MathDB
St. petersburg 2017

Source:

May 3, 2018
combinatorics

Problem Statement

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.
Back to ProblemsView on AoPS