Intersecting Domino Tilings
Steve Butler, Paul Horn, Eric Tressler · The Fibonacci Quarterly · 2010
In this note we consider an Erdős-Ko-Rado analog of tilings. Namely, given two tilings of a common region we say that they intersect if they have at least one tile in the same location. We show that for a domino tiling of the 2×n strip that the largest collection of tilings which pairwise intersect are counted by the Fibonacci numbers. We also solve the problem for tilings of the 3×(2n) strip using dominoes.