Gorenstein and Cohen-Macaulay Matching Complexes
arXiv:2106.13993 · doi:10.1142/S0219498823501463
Abstract
Let be a simple undirected graph. The family of all matchings of forms a simplicial complex called the matching complex of . Here , we give a classification of all graphs with a Gorenstein matching complex. Also we study when the matching complex of is Cohen-Macaulay and, in certain classes of graphs, we fully characterize those graphs which have a Cohen-Macaulay matching complex. In particular, we characterize when the matching complex of a graph with girth at least 5 or a complete graph is Cohen-Macaulay.
arXiv comment10 pages, 3 figures
References in corpus (7)
- Vertex decomposable graphs and obstructions to shellability
- Chordal and sequentially Cohen-Macaulay clutters
- A Characterization of Triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
- Exact Sequences for the Homology of the Matching Complex
- Chordality of Clutters with Vertex Decomposable Dual and Ascent of Clutters
- Trung's Construction and the Charney-Davis Conjecture
- Some Combinatorial Characterizations of Gorenstein Graphs with Independence Number Less than Four