Combinatorics and Graph Theory · Problem 1.1.3

Fundamentals — David Guichard

Mathematics — Combinatorics · domino-tiling

Problem

Suppose that

m

and

n

are both odd. On an

m \times n

board, colored as usual, all four corners will be the same color, say white. Suppose one white square is removed from any location on the board. Show that the resulting board can be covered.

Browse the problem library