On the Stanley depth of powers of edge ideals
arXiv:1509.04988
Abstract
Let be a field and be the polynomial ring in variables over . Let be a graph with vertices. Assume that is the edge ideal of and is the number of its bipartite connected components. We prove that for every positive integer , the inequalities and hold. As a consequence, we conclude that satisfies the Stanley's inequality for every integer . Also, it follows that satisfies the Stanley's inequality for every integer . Furthermore, we prove that if (i) is a non-bipartite graph, or (ii) at least one of the connected components of is a tree with at least one edge, then satisfies the Stanley's inequality for every integer . Moreover, we verify a conjecture of the author in special cases.