In this survey paper we first present the main properties of sequentially Cohen-Macaulay modules. Some basic examples are provided to help reader with quickly getting acquainted topic. We then discuss two generalizations notion sequential Cohen-Macaulayness which inspired by a theorem J\"urgen Herzog and third author.

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.

Let D be a weighted oriented graph, whose underlying graph is G , and let I (D) its edge ideal. If has no 3-, 5-, or 7-cycles, K?nig, we characterize when unmixed. 3- 5-cycles, Cohen–Macaulay. We prove that unmixed if only Cohen–Macaulay girth greater than 7 K?nig 4-cycles.

A tetrahedral curve is a (usually nonreduced) curve in P defined by an unmixed, height two ideal generated by monomials. We characterize when these curves are arithmetically Cohen-Macaulay by associating a graph to each curve and, using results from combinatorial commutative algebra and Alexander duality, relating the structure of the complementary graph to the Cohen-Macaulay property.

This paper shows that if [Formula: see text] is a homomorphic image of Cohen–Macaulay local ring, then text]-module sequentially generalized and only the difference between Hilbert coefficients arithmetic degrees for all distinguished parameter ideals are bounded.

Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no chordless 4-cycles are shellable and sequentially Cohen-Macaulay. We use this result to characterize the obstructions to shellability in flag complexes, exte...