Abstract
We give an upper bound for the Stanley depth of the edge ideal of a -partite complete graph and show that Stanley's conjecture holds for . Also we give an upper bound for the Stanley depth of the edge ideal of a -uniform complete bipartite hypergraph.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.