A Note on One-Hole Domino Tilings of Squares and Rectangles

Abstract

We consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on the $(2k+1)\times (2k+1)$ square grid, we show that the number of near-perfect matchings is a multiple of $2^k$, and from this follows a conjecture of Kong that the total number of near-perfect matchings is a multiple of $2^k$. We also determine the parity of the number of near-perfect matchings with a particular vacancy for the rectangle case.