Matching complexes of polygonal line tilings
Combinatorics
2022-06-17 v2
Abstract
The matching complex of a simple graph is a simplicial complex consisting of the matchings on . Jeli\'c Milutinovi\'c 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.
Keywords
Cite
@article{arxiv.1910.00186,
title = {Matching complexes of polygonal line tilings},
author = {Takahiro Matsushita},
journal= {arXiv preprint arXiv:1910.00186},
year = {2022}
}
Comments
19 pages, final version, to appear in Hokkaido Mathematical Journal