Combinatorics and Graph Theory · Problem 1.1.7

Fundamentals — David Guichard

Mathematics — Combinatorics · domino-tiling

Problem

Suppose one white and one black square are removed from an n×nn \times n board, nn even. Show that the remainder can be covered by dominoes.

Browse the problem library