pith. sign in

arxiv: 1604.00656 · v1 · pith:5BBP6UVHnew · submitted 2016-04-03 · 🧮 math.AC · math.CO

Depth, Stanley depth and regularity of ideals associated to graphs

classification 🧮 math.AC math.CO
keywords depthsdepthmathbbgraphidealproveassociatedassume
0
0 comments X
read the original abstract

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{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 ${\rm sdepth}(J)\geq n-\nu_{o}(G)$ and ${\rm sdepth}(S/J)\geq n-\nu_{o}(G)-1$, where $\nu_{o}(G)$ is the ordered matching number of $G$. We also prove the inequalities ${\rm sdepth}(J^k)\geq {\rm depth}(J^k)$ and ${\rm sdepth}(S/J^k)\geq {\rm depth}(S/J^k)$, for every integer $k\gg 0$, when $G$ is a bipartite graph. Moreover, we provide an elementary proof for the known inequality ${\rm reg}(S/I)\leq \nu_{o}(G)$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.