MathDB
Existence of domino tiling

Source: Austrian-Polish 1978, Problem 7

July 5, 2015
combinatorics

Problem Statement

Let MM be the set of all lattice points in the plane (i.e. points with integer coordinates, in a fixed Cartesian coordinate system). For any point P=(x,y)MP=(x,y)\in M we call the points (x1,y)(x-1,y), (x+1,y)(x+1,y), (x,y1)(x,y-1), (x,y+1)(x,y+1) neighbors of PP. Let SS be a finite subset of MM. A one-to-one mapping ff of SS onto SS is called perfect if f(P)f(P) is a neighbor of PP, for any PSP\in S. Prove that if such a mapping exists, then there exists also a perfect mapping g:SSg:S\to S with the additional property g(g(P))=Pg(g(P))=P for PSP\in S.