Related papers: Binomial edge ideals of small depth

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…

In this paper we give upper bounds for the regularity of edge ideal of some classes of graphs in terms of invariants of graph. We introduce two numbers $a'(G)$ and $n(G)$ depending on graph $G$ and show that for a vertex decomposable graph…

For a graph $G$, Bolognini et al. have shown $J_{G}$ is strongly unmixed $\Rightarrow$ $J_{G}$ is Cohen-Macaulay $\Rightarrow$ $G$ is accessible, where $J_{G}$ denotes the binomial edge ideals of $G$. Accessible and strongly unmixed…

Let I be a homogeneous ideal of a polynomial ring S. We prove that if the initial ideal J of I, w.r.t. a term order on S, is square-free, then the extremal Betti numbers of S/I and of S/J coincide. In particular, depth(S/I)=depth(S/J) and…

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

Let $G$ be a simple graph on the vertex set $\{1,\ldots,n\}$ with $m$ edges. An algebraic object attached to $G$ is the ideal $P_{G}$ generated by diagonal 2-minors of an $n \times n$ matrix of variables. In this paper we prove that if $G$…

We provide a closed formula for the graded Betti numbers in the linear strands of all powers of binomial edge ideals $J_G$ arising from closed graphs $G$ that do not have the complete graph $K_4$ as an induced subgraph. We show that these…

We discuss algebraic and homological properties of binomial edge ideals associated to graphs which are obtained by gluing of subgraphs and the formation of cones.

In this article, we explore the class of graphs for which the projective dimension of the quotient of the binomial edge ideals matches the big height of that ideal. Additionally, we investigate the Vasconcelos number of binomial edge ideals…

Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…

Connected bipartite graphs whose binomial edge ideals are Cohen--Macaulay have been classified by Bolognini et al. In this paper, we compute the depth, Castelnuovo--Mumford regularity, and dimension of the generalized binomial edge ideals…

We introduce a new class of polynomial ideals associated to a simple graph, $G$. Let $K[E_G]$ be the polynomial ring on the edges of $G$ and $K[V_G]$ the polynomial ring on the vertices of $G$. We associate to $G$ an ideal, $I(X_G)$,…

Let $I$ be the edge ideal of a connected non-bipartite graph and $R$ the base polynomial ring. Then $\operatorname{depth} R/I \ge 1$ and $\operatorname{depth} R/I^t = 0$ for $t \gg 1$. We give combinatorial conditions for…

Let $I$ and $J$ be edge ideals in a polynomial ring $R = \mathbb{K}[x_1,\ldots,x_n]$ with $I \subseteq J$. In this paper, we obtain a general upper and lower bound for the Castelnuovo-Mumford regularity of $IJ$ in terms of certain…

Let $G$ be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate $G$ with the edge polytope ${\cal P}_G$ and the toric ideal $I_G$. By classifying graphs whose edge polytope is simple, it is proved that…

Let $G$ be a graph on $n$ vertices and $m$ edges and $D(G,x)$ the domination polynomial of $G$. In this paper we completely characterize the values of $n$ and $m$ for which optimal graphs exist for domination polynomials. We also show that…

We study minimal reductions of edge ideals of graphs and determine restrictions on the coefficients of the generators of these minimal reductions. We prove that when $I$ is not basic, then $\core{I}\subset \m I$, where $I$ is an edge ideal…

Let $S=K[x_1,\ldots,x_n]$ be the ring of polynomials over a field $K$. Given two monomial ideals $0\subset I\subsetneq J \subset S$, we present a new method to compute the Hilbert depth of $J/I$. As an application, we show that if $u\in S$…

A graph is closed when its vertices have a labeling by $[n]$ such that the binomial edge ideal $J_G$ has a quadratic Gr\"{o}bner basis with respect to the lexicographic order induced by $x_1 > \cdots > x_n > y_1> \cdots > y_n$. In this…

Herzog-Hibi-Hreind\'{o}ttir-Kahle-Rauh introduced the class of closed graph and they proved that the binomial edge ideal $J(G)$ of a graph $G$ has quadratic Gr\"{o}bner bases if $G$ is closed. In this paper, we introduce the class of weakly…