Matching complexes of polygonal line tilings

被引：5
|
作者：
Matsushita, Takahiro [1 ]
机构：
[1] Univ Ryukyus, Dept Math Sci, Nishihara Cho, Okinawa, Japan
来源：
HOKKAIDO MATHEMATICAL JOURNAL | 2022年 / 51卷 / 03期
关键词：
matchings; matching complexes; independence complexes; CHESSBOARD;
D O I：
10.14492/hokmj/2019-213
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The matching complex of a simple graph G is the simplicial complex consisting of the matchings on G. Jelic ' Milutinovic ' et al. [6] studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the connec-tivity of the matching complexes of polygonal line tilings. In this paper, we determine the homotopy types of the matching complexes of polygonal line tilings recursively, and determine their connectivities.
引用
收藏
页码：339 / 359
页数：21
相关论文
共 50 条
12345