Abstract
Let be a weighted oriented graph and let I() be its edge ideal. Under a natural condition that the underlying (undirected) graph of contains a perfect matching consisting of leaves, we provide several equivalent conditions for the Cohen-Macaulayness of I(). We also completely characterize the Cohen-Macaulayness of I() when the underlying graph of is a bipartite graph. When I() fails to be Cohen-Macaulay, we give an instance where I() is shown to be sequentially Cohen-Macaulay.
Original language | English (US) |
---|---|
Pages (from-to) | 535-559 |
Number of pages | 25 |
Journal | International Journal of Algebra and Computation |
Volume | 29 |
Issue number | 3 |
DOIs | |
State | Published - May 1 2019 |
All Science Journal Classification (ASJC) codes
- General Mathematics