Given a graph $G$ on the vertex set $V$, the non-matching complex of $G$, ${\mathsf{NM}}_k(G)$, is the family of subgraphs $G^{\prime }\subset G$ whose matching number $\nu (G^{\prime })$ is strictly less …