Related papers: Edge Ideals of Weighted Graphs

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of…

Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gr\"obner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely…

Let $G$ be a finite simple graph, and $J_G$ denote the binomial edge ideal of $G$. In this article, we first compute the $\mathrm{v}$-number of binomial edge ideals corresponding to Cohen-Macaulay closed graphs. As a consequence, we obtain…

We investigate the analytic spread of binomial edge ideals of finite simple graphs. We provide tight bounds for this invariant in general. For special families of graphs (e.g., closed graphs, pseudo-forests), we compute the exact value for…

We investigate Sharifan and Moradi's closed neighborhood ideal of a finite simple graph, which is a square-free monomial ideal in a polynomial ring over a field. We explicitly describe the minimal irreducible decompositions of these ideals.…

Let $G$ be a Cameron--Walker graph on $n$ vertices and $J_G$ the binomial edge ideal of $G$. Let $S$ denote the polynomial ring in $2n$ variables over a field. It is shown that the following conditions are equivalent: (i) $S/J_G$ is…

Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…

This paper presents exact formulas for the regularity and depth of powers of edge ideals of an edge-weighted star graph. Additionally, we provide exact formulas for the regularity of powers of the edge ideal of an edge-weighted integrally…

Let $G$ be a graph with $n$ vertices, $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$ and $I(G)$ denote the edge ideal of $G$. For every collection $\mathcal{H}$ of connected graphs with…

Let $G$ be a finite graph and $I(G)$ its edge ideal. We give a full description of the Stanley--Reisner complex of the polarization of $I(G)^2$, naturally introducing the tools of Stanley--Reisner theory in the study of the algebraic…

Let $G$ be a graph on the vertex set $[n]$ and $J_G$ the associated binomial edge ideal in the polynomial ring $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$. In this paper we investigate the depth of binomial edge ideals. More precisely, we…

Let $X$ be the Hankel matrix of size $2\times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_G\subset K[x_1,\ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the…

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…

We classify all normal edge ideals of edge-weighted graphs.

In this paper, we introduce the concept of complementary edge ideals of graphs and study their algebraic properties and invariants.

We define a simple graph as compact if it lacks even cycles and satisfies the odd-cycle condition. Our focus is on classifying all compact graphs and examining the characteristics of their edge rings. Let $G$ be a compact graph and…

Let $\mathbf{CCM}$ denote the class of closed graphs with Cohen-Macaulay binomial edge ideals and $\mathbf{PIG}$ denote the class of proper interval graphs. Then $\mathbf{CCM}\subseteq \mathbf{PIG}$. The $\mathbf{PIG}$-completion problem is…

Let $G$ be a simple graph on $n$ vertices. Let $L_G \text{ and } \mathcal{I}_G \: $ denote the Lov\'asz-Saks-Schrijver(LSS) ideal and parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots,…

Let C be a clutter and let I(C) be its edge ideal. This is a survey paper on the algebraic and combinatorial properties of R/I(C) and C, respectively. We give a criterion to estimate the regularity of R/I(C) and apply this criterion to give…

Given a vertex-weighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which…