加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本