Problem

Source: Cyprus 2021Junior TST-2 Problem 4

Tags: combinatorics, pigeonhole principle, Ramsey Theory



We colour every square of a $4\times 19$ chess board with one of the colours red, green and blue. Prove that however this colouring is done, we can always find two horizontal rows and two vertical columns such that the $4$ squares on the intersections of these lines all have the same colour.