Gorenstein and Cohen–Macaulay matching complexes

DOI10.1142/S0219498823501463MaRDI QIDQ6163890zbMATH OpenOpenAlexFDO

Authors Ashkan Nikseresht

Publication date 30 June 2023

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2106.13993

zbMATH Keywords

Cohen-Macaulay ringedge idealGorenstein ringline graphmatching complex

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Combinatorial aspects of simplicial complexes (05E45) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Abstract: 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 graphs with a Gorenstein matching complex. Also we study when the matching complex of $H$ 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.

Recommendations

• Line graphs with a Cohen-Macaulay or Gorenstein clique complex
• A characterization of two-dimensional Buchsbaum matching complexes
• Cohen-Macaulay graphs with large girth
• Cohen-Macaulayness of a class of graphs versus the class of their complements
• Simplicial Cohen-Macaulay complexes

Cites work

• A Characterization of Gorenstein Planar graphs
• A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
• Algebraic study on Cameron-Walker graphs
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Chordal and sequentially Cohen-Macaulay clutters
• Chordality of clutters with vertex decomposable dual and ascent of clutters
• Cohen-Macaulay edge ideal whose height is half of the number of vertices
• Combinatorics and commutative algebra.
• Exact sequences for the homology of the matching complex
• scientific article; zbMATH DE number 5717196 (Why is no real title available?)
• scientific article; zbMATH DE number 482758 (Why is no real title available?)
• MANIFOLD MATCHING COMPLEXES
• Monomial Ideals
• The graphs with maximum induced matching and maximum matching the same size
• Topology of matching, chessboard, and general bounded degree graph complexes
• Trung's construction and the Charney-Davis conjecture
• Vertex decomposable graphs and obstructions to shellability

Cited in

(8)

• Cohen-Macaulayness of a class of graphs versus the class of their complements
• A characterization of two-dimensional Buchsbaum matching complexes
• Simplicial Cohen-Macaulay complexes
• The Greedy Algorithm and the Cohen-Macaulay Property of Rings, Graphs and Toric Projective Curves
• Cohen-Macaulay graphs with large girth
• Line graphs with a Cohen-Macaulay or Gorenstein clique complex
• Well-covered unitary Cayley graphs of matrix rings over finite fields and applications
• A numerical characterization of Gorenstein complexes

This page was built for publication: Gorenstein and Cohen–Macaulay matching complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163890)