Abstract

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

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.