Cohen-Macaulay, Shellable and unmixed clutters with a perfect matching of K\"onig type

Abstract

Let C be a clutter with a perfect matching e1,...,eg of K\"onig type and let C be the Stanley-Reisner complex of the edge ideal of C. If all c-minors of C have a free vertex and C is unmixed, we show that C is pure shellable. We are able to describe, in combinatorial and algebraic terms, when C is pure. If C has no cycles of length 3 or 4, then it is shown that C is pure if and only if C is pure shellable (in this case ei has a free vertex for all i), and that C is pure if and only if for any two edges f1,f2 of C and for any ei, one has that f1 ei⊂ f2 ei or f2 ei⊂ f1 ei. It is also shown that this ordering condition implies that C is pure shellable, without any assumption on the cycles of C. Then we prove that complete admissible uniform clutters and their Alexander duals are unmixed. In addition, the edge ideals of complete admissible uniform clutters are facet ideals of shellable simplicial complexes, they are Cohen-Macaulay, and they have linear resolutions. Furthermore if C is admissible and complete, then C is unmixed. We characterize certain conditions that occur in a Cohen-Macaulay criterion for bipartite graphs of Herzog and Hibi, and extend some results of Faridi--on the structure of unmixed simplicial trees--to clutters with the K\"onig property without 3-cycles or 4-cycles.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…