Depth, Stanley depth and regularity of ideals associated to graphs

preprint2016arXivOpen access

Abstract

Let K\mathbb{K} be a field and S=K[x1,…,xn]S=\mathbb{K}[x_1,\dots,x_n] be the polynomial ring in nn variables over K\mathbb{K}. Let GG be a graph with nn vertices. Assume that I=I(G)I=I(G) is the edge ideal of GG and J=J(G)J=J(G) is its cover ideal. We prove that sdepth(J)≥n−νo(G){\rm sdepth}(J)\geq n-ν_{o}(G) and sdepth(S/J)≥n−νo(G)−1{\rm sdepth}(S/J)\geq n-ν_{o}(G)-1, where νo(G)ν_{o}(G) is the ordered matching number of GG. We also prove the inequalities sdepth(Jk)≥depth(Jk){\rm sdepth}(J^k)\geq {\rm depth}(J^k) and sdepth(S/Jk)≥depth(S/Jk){\rm sdepth}(S/J^k)\geq {\rm depth}(S/J^k), for every integer k≫0k\gg 0, when GG is a bipartite graph. Moreover, we provide an elementary proof for the known inequality reg(S/I)≤νo(G){\rm reg}(S/I)\leq ν_{o}(G).

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.