Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type
From MaRDI portal
Publication:2481813
DOI10.1016/j.jpaa.2007.11.010zbMath1141.13017arXiv0708.3111OpenAlexW2962992781MaRDI QIDQ2481813
Rafael H. Villarreal, Susan Morey, Enrique Reyes
Publication date: 15 April 2008
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0708.3111
Hypergraphs (05C65) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Structural characterization of families of graphs (05C75)
Related Items
Recursive Betti numbers for Cohen-Macaulay \(d\)-partite clutters arising from posets ⋮ On well-covered, vertex decomposable and Cohen-Macaulay graphs ⋮ Cohen-Macaulay admissible clutters ⋮ Pure vertex decomposable simplicial complex associated to graphs whose 5-cycles are chorded ⋮ A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra ⋮ Symbolic powers of cover ideal of very well-covered and bipartite graphs ⋮ Monomial ideals and toric rings of Hibi type arising from a finite poset ⋮ Koszulness, Krull dimension, and other properties of graph-related algebras ⋮ Cohen-Macaulay edge ideal whose height is half of the number of vertices ⋮ The Behaviors of Expansion Functor on Monomial Ideals and Toric Rings ⋮ Cohen-Macaulay and Gorenstein Path Ideals of Trees ⋮ Monomial ideals of weighted oriented graphs ⋮ Some algebraic properties of hypergraphs ⋮ Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs ⋮ Graded ideals of König type ⋮ On the sequentially Cohen–Macaulay properties of almost complete multipartite graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
- Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems
- Resolutions of Stanley-Reisner rings and Alexander duality
- On the ideal theory of graphs
- Cohen-Macaulay bipartite graphs
- Algebraic shifting and sequentially Cohen-Macaulay simplicial complexes
- On certain polytopes associated with graphs
- Cohen-Macaulay properties of square-free monomial ideals
- Cohen-Macaulay graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Simplicial trees are sequentially Cohen-Macaulay
- Dirac's theorem on chordal graphs and Alexander duality
- Combinatorics and commutative algebra.
- Distributive lattices, bipartite graphs and Alexander duality
- Combinatorial Optimization
- Resolutions of Facet Ideals
- On the bettinumbers of finite pure and linear resolutions
- Standard graded vertex cover algebras, cycles and leaves
- WELL-COVERED GRAPHS: A SURVEY
- Shellable Nonpure Complexes and Posets. I
- Some covering concepts in graphs
- Balanced matrices