Gorenstein and Cohen-Macaulay Matching Complexes

Ashkan Nikseresht

Let $H$ be a simple undirected graph. The family of all matchings of $H$ forms a simplicial complex called the matching complex of $H$. Here , we give a classification of all graph…