vix.ing · top · new · best · stats · spec

Depth, Stanley depth and regularity of ideals associated to graphs

2016/04/03 by Fakhari, S. A. Seyed
#Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics

paper · doi:10.48550/arxiv.1604.00656

Abstract

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

Related