Stanley depth of edge ideals

From MaRDI portal



Abstract: We give an upper bound for the Stanley depth of the edge ideal I of a k-partite complete graph and show that Stanley's conjecture holds for I. Also we give an upper bound for the Stanley depth of the edge ideal of a k-uniform complete bipartite hypergraph.











This page was built for publication: Stanley depth of edge ideals

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