Chordal and sequentially Cohen-Macaulay clutters

From MaRDI portal
Revision as of 08:48, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:648399

zbMath1236.05213arXiv0911.4697MaRDI QIDQ648399

Russ Woodroofe

Publication date: 22 November 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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




Related Items (38)

Simplicial orders and chordalityRecursive Betti numbers for Cohen-Macaulay \(d\)-partite clutters arising from posetsIncreasing spanning forests in graphs and simplicial complexesStanley-Reisner RingsOn the Stanley-Reisner ideal of an expanded simplicial complex\(W_2\)-graphs and shedding verticesEdgewise strongly shellable cluttersPartial coloring, vertex decomposability and sequentially Cohen-Macaulay simplicial complexesShedding vertices and ass-decomposable monomial idealsChordal graphs, higher independence and vertex decomposable complexesGorenstein and Cohen–Macaulay matching complexesComponentwise linearity of powers of cover idealsDominance complexes and vertex cover numbers of graphsChains of modular elements and shellabilityHomological invariants of the Stanley–Reisner ring of a k-decomposable simplicial complexThe type defect of a simplicial complexSome algebraic properties of t-clique idealsMultigraded minimal free resolutions of simplicial subcluttersMonomial ideals with 3-linear resolutionsNon-ridge-chordal complexes whose clique complex has shellable Alexander dualStability of Betti numbers under reduction processes: towards chordality of cluttersCodismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphsUpper bounds for the regularity of powers of edge ideals of graphsObstructions to shellability, partitionability, and sequential Cohen-MacaulaynessExposed circuits, linear quotients, and chordal cluttersCompletion and decomposition of a clutter into representable matroidsA criterion for a monomial ideal to have a linear resolution in characteristic 2The linear syzygy graph of a monomial ideal and linear resolutionsCohen–Macaulay modifications of the facet ideal of a simplicial complexHigher chordality: From graphs to complexesChordality, \(d\)-collapsibility, and componentwise linear idealsOn linear quotients of squarefree monomial ideals1-well-covered graphs revisitedBounding the projective dimension of a squarefree monomial ideal via domination in cluttersChordality of clutters with vertex decomposable dual and ascent of cluttersBetti numbers of fat forests and their Alexander dualUpper bounds for the regularity of gap-free graphs in terms of minimal triangulationVertex decomposability of 2-CM and Gorenstein simplicial complexes of codimension 3


Uses Software



This page was built for publication: Chordal and sequentially Cohen-Macaulay clutters