Edge ideals of oriented graphs

From MaRDI portal
Publication:5380265




Abstract: Let mathcalD be a weighted oriented graph and let I(mathcalD) be its edge ideal. Under a natural condition that the underlying (undirected) graph of mathcalD contains a perfect matching consisting of leaves, we provide several equivalent conditions for the Cohen-Macaulayness of I(mathcalD). We also completely characterize the Cohen-Macaulayness of I(mathcalD) when the underlying graph of mathcalD is a bipartite graph. When I(mathcalD) fails to be Cohen-Macaulay, we give an instance where I(mathcalD) is shown to be sequentially Cohen-Macaulay.









This page was built for publication: Edge ideals of oriented graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380265)