MathDB

A set of (unit) squares of a

n\times n

table is called convenient if each row and each column of the table contains at least two squares belonging to the set. For each

n\geq 5

determine the maximum

m

for which there exists a convenient set made of

m

squares, which becomes inconvenient when any of its squares is removed.

Problem Statement