On the matching complexes of categorical product of path graphs

Raju Kumar Gupta, Sourav Sarkar, Sagar S. Sawant +1

The matching complex $\mathsf{M}(G)$ of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. These complexes appear in various places and found applications in…