多边形线条拼接的匹配复合体

Pub Date : 2019-10-01 DOI:10.14492/hokmj/2019-213

Takahiro Matsushita

{"title":"多边形线条拼接的匹配复合体","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":"{\"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}","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

摘要

简单图$G$的匹配复形是由$G$上的匹配组成的一个简单复形。Jelic-Milutinovic等人研究了多边形网格的匹配复合体，给出了多边形网格匹配复合体连通性的下界。在本文中，我们递归地确定了多角线tilings的匹配复形的同构类型，并确定了它们的连通性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

Matching complexes of polygonal line tilings

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助