Related papers: Regularity and h-polynomials of binomial edge idea…

We study homological properties of random quadratic monomial ideals in a polynomial ring $R = {\mathbb K}[x_1, \dots x_n]$, utilizing methods from the Erd\"{o}s-R\'{e}nyi model of random graphs. Here for a graph $G \sim G(n, p)$ we consider…

We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. We also characterize all generalized block graphs whose…

For a partition $\lambda$ of $n \in {\mathbb N}$, let $I^{\rm Sp}_\lambda$ be the ideal of $R=K[x_1,\ldots,x_n]$ generated by all Specht polynomials of shape $\lambda$. In the previous paper, the second author showed that if $R/I^{\rm…

Let $G$ be a simple graph on the vertex set $[n]$ and $J_G$ be the corresponding binomial edge ideal. Let $G=v*H$ be the cone of $v$ on $H$. In this article, we compute all the Betti numbers of $J_G$ in terms of Betti number of $J_H$ and as…

Binomial edge ideals associated to a simple graph G were introduced by Herzog and collaborators and, independently, by Ohtani. They became an ``instant classic" in combinatorial commutative algebra with more than 100 papers devoted to their…

Let $G$ be the circulant graph $C_n(S)$ with $S \subseteq \{1, 2, \dots, \lfloor \frac{n}{2} \rfloor\}$, and let $I(G)$ denote the edge ideal in the polynomial ring $R=\mathbb{K}[x_0, x_1, \dots, x_{n-1}]$ over a field $\mathbb{K}$. In this…

In this paper, we prove the upper bound conjecture proposed by Saeedi Madani \& Kiani on the Castelnuovo-Mumford regularity of generalized binomial edge ideals. We give a combinatorial upper bound of regularity for generalized binomial edge…

In this article, we study the powers of the generalized binomial edge ideal $\mathcal{J}_{K_m,P_n}$ of a path graph $P_n$. We explicitly compute their regularities and determine the limit of their depths. We also show that these ordinary…

In this paper we provide a full combinatorial characterization of sequentially Cohen-Macaulay binomial edge ideals of closed graphs. In addition, we show that a binomial edge ideal of a closed graph is approximately Cohen-Macaulay if and…

In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a graph $G$, we define the invariant $\eta(G)$ as the maximum size of a clique disjoint edge set in $G$. We show that the regularity of the binomial…

We provide a Hochster type formula for the local cohomology modules of binomial edge ideals. As a consequence we obtain a simple criterion for the Cohen-Macaulayness of these ideals and we describe their Castelnuovo-Mumford regularity and…

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.

The growth of Hilbert coefficients for powers of ideals are studied. For a graded ideal $I$ in the polynomial ring $S=K[x_1,...,x_n]$ and a finitely generated graded $S$-module, the Hilbert coefficients $e_i(M/I^kM)$ are polynomial…

We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…

Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…

Let $\mathbb{K}[G]$ be the edge ring of a finite simple graph $G$. Investigating properties of the $h$-vector of $\mathbb{K}[G]$ is of great interest in combinatorial commutative algebra. However, there are few families of graphs for which…

In this article, we investigate the combinatorial and algebraic properties of the lcm-lattice associated with the edge ideal of a hypergraph. Let $\H$ be a hypergraph, $I(\H)$ its corresponding edge ideal in a polynomial ring in $n$…

A combinatorial property that characterizes Cohen-Macaulay binomial edge ideals has long been elusive. A recent conjecture ties the Cohen-Macaulayness of a binomial edge ideal $J_G$ to special disconnecting sets of vertices of its…

As the binomial edge ideal of a graph is always generated by homogeneous quadratic polynomials corresponding to the edges of the graph, the question of when a binomial edge ideal defines a Koszul algebra has been studied by many authors…

Let $n\geq m$ be two positive integers, $S_{n,m}=K[x_1,\ldots,x_n,y_1,\ldots,y_m]$ and $I_{n,m}=(x_iy_j\;:\;1\leq i\leq n,1\leq j\leq m)\subset S_{n,m}$ the edge ideal of a complete bipartite graph. Denote…