English

Depth, Stanley depth and regularity of ideals associated to graphs

Commutative Algebra 2016-04-05 v1 Combinatorics

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-\nu_{o}(G) and sdepth(S/J)nνo(G)1{\rm sdepth}(S/J)\geq n-\nu_{o}(G)-1, where νo(G)\nu_{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 k0k\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 \nu_{o}(G).

Keywords

Cite

@article{arxiv.1604.00656,
  title  = {Depth, Stanley depth and regularity of ideals associated to graphs},
  author = {S. A. Seyed Fakhari},
  journal= {arXiv preprint arXiv:1604.00656},
  year   = {2016}
}