MathDB
Polyomino and Coloring

Source:

March 24, 2021
combinatoricskomal

Problem Statement

A polyomino is a figure which consists of unit squares joined together by their sides. (A polyomino may contain holes.) Let n3n\ge3 be a positive integer. Consider a grid of unit square cells which extends to infinity in all directions. Find, in terms of nn, the greatest positive integer CC which satisfies the following condition: For every colouring of the cells of the grid in nn colours, there is some polyomino within the grid which contains at most n1n-1 colours and whose area is at least CC.
Proposed by Nikolai Beluhov, Stara Zagora, Bulgaria and Stefan Gerdjikov, Sofia, Bulgaria