Depth, Stanley depth and regularity of ideals associated to graphs

Abstract

Let K be a field and S=K[x1,…,xn] be the polynomial ring in n variables over K. 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 sdepth(J)≥ n-o(G) and sdepth(S/J)≥ n-o(G)-1, where o(G) is the ordered matching number of G. We also prove the inequalities sdepth(Jk)≥ depth(Jk) and sdepth(S/Jk)≥ depth(S/Jk), for every integer k 0, when G is a bipartite graph. Moreover, we provide an elementary proof for the known inequality reg(S/I)≤ o(G).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…