INTERSECTING DOMINO TILINGS

被引：0
|
作者：
Butler, Steve [1 ]
Horn, Paul [2 ]
Tressler, Eric [3 ]
机构：
[1] Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA
[2] Emory Univ, Math & Comp Sci, Atlanta, GA 30322 USA
[3] Univ Calif San Diego, Dept Math, San Diego, CA 92093 USA
来源：
FIBONACCI QUARTERLY | 2010年 / 48卷 / 02期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this note we consider an Erdos-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 x 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 3x(2n) strip using dominoes.
引用
收藏
页码：114 / 120
页数：7
相关论文
共 50 条
12345