Related papers: Complementary edge ideals
Let I be an m-primary ideal of a Noetherian local ring (R,m). We consider the Gorenstein and complete intersection properties of the associated graded ring G(I) and the fiber cone F(I) of I as reflected in their defining ideals as…
If I is an ideal in a Gorenstein ring S and S/I is Cohen-Macaulay, then the same is true for any linked ideal I'. However, such statements hold for residual intersections of higher codimension only under very restrictive hypotheses, not…
Let $G$ be a graph with $n$ vertices and let $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$. Assume that $I(G)$ and $J(G)$ denote the edge ideal and the cover ideal of $G$, respectively. We…
The local complement G*i of a simple graph G at one of its vertices i is obtained by complementing the subgraph induced by the neighborhood of i and leaving the rest of the graph unchanged. If e={i,j} is an edge of G then G*e=((G*i)*j)*i is…
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…
B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a…
Fix an integer $n \geq 1$, and consider the set of all connected finite simple graphs on $n$ vertices. For each $G$ in this set, let $I(G)$ denote the edge ideal of $G$ in the polynomial ring $R = K[x_1,\ldots,x_n]$. We initiate a study of…
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…
In this paper, we focus on the associated primes of powers of monomial ideals and asymptotic behavior properties such as normally torsion-freeness, normality, the strong persistence property, and the persistence property. In particular, we…
Several algebraic properties of a binomial edge ideal $J_G$ can be interpreted in terms of combinatorial properties of its associated graph $G$. In particular, the so-called cut sets of a graph $G$, special sets of vertices that disconnect…
We study powers of binomial edge ideals associated with closed and block graphs.
We classify all unmixed monomial ideals I of codimension 2 which are generically a complete intersection and which have the property that the symbolic power algebra A(I) is standard graded. We give a lower bound for the highest degree of a…
Let I(G) be the edge ideal associated to a simple graph G. We study the graded Betti numbers that appear in the linear strand of the minimal free resolution of I(G).
In this article, we study algebraic properties of binomial edge ideals of Levi graphs associated with certain plane curve arrangements. Using combinatorial properties of Levi graphs, we discuss the Cohen-Macaulayness of binomial edge ideals…
Let $G$ be a finite simple graph and let $I(G)$ denote its edge ideal. For $q \ge 1$, the $q$-th squarefree power $I(G)^{[q]}$ is generated by squarefree monomials corresponding to matchings of size $q$ in $G$. We denote by…
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}$. Assume that $G$ is a graph with edge ideal $I(G)$. We prove that the modules $S/\overline{I(G)^k}$ and…
In this paper we prove the existence of a special order on the set of minimal monomial generators of powers of edge ideals of arbitrary graphs. Using this order we find new upper bounds on the regularity of powers of edge ideals of graphs…
Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gr\"obner bases and are radical if only if the graph is bipartite or the characteristic of the ground field is…
In this paper, we investigate when symbolic and ordinary powers of the parity binomial edge ideal of a graph fail to be equal. It turns out that if $\mathcal{I}_{G}$ is the parity binomial edge ideal of a graph $G$, then in each of the…
Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we prove that if $G$ is a fan graph of a complete graph, then…