Matching complexes of small grids (Q2001978)

Summary: The matching complex \(M(G)\) of a simple graph $G$ is the simplicial complex consisting of the matchings on \(G\). The matching complex \(M(G)\) is isomorphic to the independence complex of the line graph \(L(G)\). \textit{B. Braun} and \textit{W. K. Hough} [ibid. 24, No. 4, Research Paper P18, 20 p. (2017; Zbl 1373.05137)] introduced a family of graphs \(\Delta^m_n\), which is a generalization of the line graph of the \((n \times 2)\)-grid graph. In this paper, we show that the independence complex of \(\Delta^m_n\) is a wedge of spheres. This gives an answer to a problem suggested by Braun and Hough [loc. cit.].