Results 1 to 10 of about 213,086 (270)
Koszul binomial edge ideals [PDF]
It is shown that if the binomial edge ideal of a graph $G$ defines a Koszul algebra, then $G$ must be chordal and claw free.
A. Conca +16 more
core +2 more sources
Smoothness in Binomial Edge Ideals [PDF]
In this paper we study some geometric properties of the algebraic set associated to the binomial edge ideal of a graph. We study the singularity and smoothness of the algebraic set associated to the binomial edge ideal of a graph. Some of these algebraic
Hamid Damadi, Farhad Rahmati
doaj +3 more sources
Cohen-Macaulay binomial edge ideals [PDF]
We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.Comment: 9 ...
Ene, Viviana +2 more
core +5 more sources
Edge ideals and DG algebra resolutions [PDF]
Let R = S/I where S = k[T_1, . . . , T_n] and I is a homogeneous ideal in S. The acyclic closure R<Y> of k over R is a DG algebra resolution obtained by means of Tate’s process of adjoining variables to kill cycles.
Adam Boocher +4 more
doaj +5 more sources
Comparing Powers of Edge Ideals [PDF]
Given a nontrivial homogeneous ideal $I\subseteq k[x_1,x_2,\ldots,x_d]$, a problem of great recent interest has been the comparison of the $r$th ordinary power of $I$ and the $m$th symbolic power $I^{(m)}$.
Janssen, Mike +2 more
core +5 more sources
Regularity of the edge ideals of perfect [ν,h]-ary trees and some unicyclic graphs [PDF]
We compute the Castelnuovo-Mumford regularity of the quotient rings of edge ideals of perfect [ν,h]-ary trees and some unicyclic graphs.
Fatima Tul Zahra +2 more
doaj +2 more sources
Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs [PDF]
Let Q be a polynomial ring over a field F and I be an edge ideal associated with the whisker graph of a cubic circulant graph. We discuss the regularity, depth, Stanley depth, and projective dimension of Q/I.
Mujahid Ullah Khan Afridi +2 more
doaj +2 more sources
We compute the Betti numbers for all the powers of initial and final lexsegment edge ideals. For the powers of the edge ideal of an anti–d−path, we prove that they have linear quotients and we characterize the normally torsion–free ideals. We determine a
Carmela Ferrò +2 more
doaj +3 more sources
Computing degree based topological indices of algebraic hypergraphs [PDF]
Topological indices are numerical parameters that indicate the topology of graphs or hypergraphs. A hypergraph H=(V(H),E(H)) consists of a vertex set V(H) and an edge set E(H), where each edge e∈E(H) is a subset of V(H) with at least two elements.
Amal S. Alali +4 more
doaj +2 more sources
Gorenstein binomial edge ideals [PDF]
AbstractWe classify connected graphs G whose binomial edge ideal is Gorenstein. In our proofs we use Frobenius type techniques and F‐pure thresholds.
openaire +3 more sources

