What is the smallest number of nodes that can be marked in a rectangular $n \times k$ grid so that each cell contains at least two marked nodes?
Source: Russian TST 2017, Day 5 P2 (Groups A & B)
Tags: combinatorics, grid
What is the smallest number of nodes that can be marked in a rectangular $n \times k$ grid so that each cell contains at least two marked nodes?