MathDB
VN TST 2010 Pro 5

Source:

October 24, 2010
inductionalgorithmgraph theorycombinatorics unsolvedcombinatorics

Problem Statement

We have nn countries. Each country have mm persons who live in that country (n>m>1n>m>1). We divide mā‹…nm \cdot n persons into nn groups each with mm members such that there don't exist two persons in any groups who come from one country. Prove that one can choose nn people into one class such that they come from different groups and different countries.