Matching and Independence Complexes Related to Small Grids

Electronic Journal Of Combinatorics

Benjamin Braun¹ 

关键词: Grid Graphs;    Independence Complexes;    Recursions;    Homology;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The topology of the matching complex for the $2\times n$ grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes $\mathrm{Ind}(\Delta_n^m)$ that include these matching complexes. Using this matching, we deter

【 授权许可】

Others