Chordal and sequentially Cohen-Macaulay clutters

Russ Woodroofe
Arxiv ID: 0911.4697Last updated: 8/24/2021
We extend the definition of chordal from graphs to clutters. The resulting family generalizes both chordal graphs and matroids, and obeys many of the same algebraic and geometric properties. Specifically, the independence complex of a chordal clutter is shellable, hence sequentially Cohen-Macaulay; and the circuit ideal of a certain complement to such a clutter has a linear resolution. Minimal non-chordal clutters are also closely related to obstructions to shellability, and we give some general families of such obstructions, together with a classification by computation of all obstructions to shellability on 6 vertices.

PaperStudio AI Chat

I'm your research assistant! Ask me anything about this paper.

Related papers

Commercial Disclosure
© 2023 Paper Studio™. All Rights Reserved.