Vertex decomposability criteria for path ideal complexes
From MaRDI portal
Distance in graphs (05C12) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76) 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)
Cites work
- \(C_{4}\)-free edge ideals
- M-sequences, graph ideals, and ladder ideals of linear type
- Algebraic properties of edge ideals via combinatorial topology
- Algebraic properties of the path ideal of a tree
- Bounds on the regularity and projective dimension of ideals associated to graphs
- Chordal and sequentially Cohen-Macaulay clutters
- Chordal graphs, higher independence and vertex decomposable complexes
- Cohen-Macaulay graphs
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- scientific article; zbMATH DE number 5348111 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- Resolutions of Facet Ideals
- Shellable nonpure complexes and posets. II
- The Forbidden Minors of Binary Clutters
- Vertex decomposability of 2-CM and Gorenstein simplicial complexes of codimension 3
- Vertex decomposability of the Stanley-Reisner complex of a path ideal
- Vertex decomposable graphs and obstructions to shellability
This page was built for publication: Vertex decomposability criteria for path ideal complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7293474)