Matching complexes of $3\times \mathbf{n}$ grid graphs

Shuchita Goyal, Samir Shukla, Anurag Singh

The matching complex of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. In the last few years the matching complexes of grid graphs have gained much atten…