{"title":"Matching complexes of polygonal line tilings","authors":"Takahiro Matsushita","doi":"10.14492/hokmj/2019-213","DOIUrl":null,"url":null,"abstract":"The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jelic Milutinovic et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the connectivity 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.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.14492/hokmj/2019-213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jelic Milutinovic et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the connectivity 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.
分享
京公网安备 11010802042870号
京ICP备2023020795号-1
求助内容：
应助结果提醒方式：
扫码关注我们
