Guichard-Combinatorics-Graph-Theory · Problem 1.1.8

Fundamentals

Mathematics — Probability · domino-tiling

Problem

Suppose an n×nn \times n board, nn even, is covered with dominoes. Show that the number of horizontal dominoes with a white square under the left end is equal to the number of horizontal dominoes with a black square under the left end.

Browse the problem library