Let [Formula: see text] be a simple undirected graph. The family of all matchings forms simplicial complex called the matching text]. Here, we give classification graphs with Gorenstein complex. Also study when is Cohen–Macaulay and, in certain classes graphs, fully characterize those which have In particular, graph girth at least five or complete Cohen–Macaulay.