Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
DOI10.1016/j.jcta.2007.11.001zbMath1154.05054arXivmath/0701296OpenAlexW2158442467MaRDI QIDQ942170
Rafael H. Villarreal, Adam Van Tuyl
Publication date: 4 September 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0701296
shellable simplicial complexedge idealssequentially Cohen-MacaulayStanley Reisner ringbipartite and chordal graphsshellable bipartite graphssimplicial foresttotally balanced clutter
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (56)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel concepts in graph theory
- On the ideal theory of graphs
- Cohen-Macaulay bipartite graphs
- Algebraic shifting and sequentially Cohen-Macaulay simplicial complexes
- Cohen-Macaulay graphs
- Simplicial trees are sequentially Cohen-Macaulay
- Dirac's theorem on chordal graphs and Alexander duality
- Combinatorics and commutative algebra.
- Whiskers and sequentially Cohen-Macaulay graphs
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- Cohen--Macaulay chordal graphs
- Distributive lattices, bipartite graphs and Alexander duality
- Combinatorial Optimization
- Sequentially Cohen-Macaulay edge ideals
- Standard graded vertex cover algebras, cycles and leaves
- Componentwise linear ideals
- Shellable Nonpure Complexes and Posets. I
This page was built for publication: Shellable graphs and sequentially Cohen-Macaulay bipartite graphs