Homology of matching complexes of $3\times n$ grid graphs

Pratiksha Chauhan, Anchal Sharma, Samir Shukla

For a finite simple graph $G$, the matching complex $M(G)$ is the simplicial complex whose vertex set is the edge set of $G$ and whose simplices are all the matchings in $G$. The t…