Related papers: Stanley depth of edge ideals

In this paper, we compute the exact values of regularity of the quotient rings of the edge ideals associated to multi triangular snake and multi triangular ouroboros snake graphs. Also we compute the exact values of depth, Stanley depth,…

Let $K$ be a field and $I$ a monomial ideal of the polynomial ring $S=K[x_1,\ldots, x_n]$. We show that if either: 1) $I$ is almost complete intersection, 2) $I$ can be generated by less than four monomials; or 3) $I$ is the Stanley-Reisner…

We study the problem of partitioning the edge set of the complete graph into bipartite subgraphs under certain constraints defined by forbidden subgraphs. These constraints lead to both classical problems, such as partitioning into…

The aim of this paper is to study the Stanley depth of symbolic powers of a squarefree monomial ideal. We prove that for every squarefree monomial ideal $I$ and every pair of integers $k, s\geq 1$, the inequalities ${\rm sdepth}…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of…

Given arbitrary monomial ideals $I$ and $J$ in polynomial rings $A$ and $B$ over a field $K$, we investigate the Stanley depth of powers of the sum $I+J$, and their quotient rings, in $A\otimes_K B$ in terms of those of $I$ and $J$. Our…

The Lyubeznik size of a monomial ideal $I$ of a polynomial ring $S$ is a lower bound for the Stanley depth of $I$ decreased by $1$. A proof given by Herzog-Popescu-Vladoiu had a gap which is solved here.

In this article, we obtain an upper bound for the regularity of the binomial edge ideal of a graph whose every block is either a cycle or a clique. As a consequence, we obtain an upper bound for the regularity of binomial edge ideal of a…

Let $\operatorname{pd}(I(G))$ and $\operatorname{reg}(I(G))$ respectively denote the projective dimension and the regularity of the edge ideal $I(G)$ of a graph $G$. For any positive integer $n$, we determine all pairs…

We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a…

Let $R = \mathbb{K}[x_1, \ldots, x_n]$ and $I \subset R$ be a homogeneous ideal. In this article, we first obtain certain sufficient conditions for the subadditivity of $R/I$. As a consequence, we prove that if $I$ is generated by…

Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…

Interval minors of bipartite graphs were introduced by Jacob Fox in the study of Stanley-Wilf limits. Recently, Mohar, Rafiey, Tayfeh-Rezaie and Wu investigated the maximum number of edges in $K_{k,\ell}$-interval minor free bipartite…

Let $S=K[x_1,\ldots,x_n]$ be the ring of polynomials in $n$ variables over an arbitrary field $K$. Given a finitely generated multigraded module $M$, its Stanley length, denoted by $\operatorname{slength}(M)$, is the minimal length of a…

This paper investgates Stanley-Reisner ideals with pure resolutions. We first describe two infinite families of such ideals associated to highly symmetric complexes. We then prove a partial analogue to the first Boij-S\"oderberg Conjecture…

We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…

For a positive integer $k\ge 1$, a graph $G$ is $k$-stepwise irregular ($k$-SI graph) if the degrees of every pair of adjacent vertices differ by exactly $k$. Such graphs are necessarily bipartite. Using graph products it is demonstrated…