Gomory's theorem
From Wikipedia, the free encyclopedia
Gomory's theorem is a theorem in discrete mathematics. It states the following: If you take away one black and one white square from ordinary 8×8 chessboard, it is still possible to cover the board with 2×1 dominoes.