Guichard-Combinatorics-Graph-Theory · Problem 1.1.6

Fundamentals

Mathematics — Probability · domino-tiling

Problem

Remove two diagonally opposite corners of an

m \times n

board, where

m

is odd and

n

is even. Show that the remainder can be covered with dominoes.