Guichard-Combinatorics-Graph-Theory · Problem 4.1.5

Systems of Distinct Representatives

Mathematics — Probability · systems-of-distinct-representatives

Problem

m \times n

chessboard, with

m

even and both

m

and

n

at least 2, has one white and one black square removed. Show that the board can be covered by dominoes.