MathDB
Coloring columns that still differentiates rows

Source: 2012 Indonesia Round 2 TST 3 Problem 2

March 18, 2012
inductionRoss Mathematics Programcombinatorics proposedcombinatorics

Problem Statement

An m×nm \times n chessboard where m≤nm \le n has several black squares such that no two rows have the same pattern. Determine the largest integer kk such that we can always color kk columns red while still no two rows have the same pattern.
Back to ProblemsView on AoPS