Results 1 to 10 of about 138,912 (199)
Smoothness in Binomial Edge Ideals [PDF]
Mathematics, 2016 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
Le Matematiche, 2012 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
Gorenstein binomial edge ideals [PDF]
Mathematische Nachrichten, 2021 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
Depth and Stanley Depth of the Edge Ideals of r-Fold Bristled Graphs of Some Graphs
Mathematics, 2023 In this paper, we find values of depth, Stanley depth, and projective dimension of the quotient rings of the edge ideals associated with r-fold bristled graphs of ladder graphs, circular ladder graphs, some king’s graphs, and circular king’s graphs.
Ying Wang +5 more
doaj +1 more source
When Is a Graded Free Complex Exact?
Mathematics, 2022 Minimal free resolutions of a finitely generated module over a polynomial ring S=k[x], with variables x={x1,…,xn} and a field k have been extensively studied.
David C. Molano +2 more
doaj +1 more source
The regularity of binomial edge ideals of graphs [PDF]
AUT Journal of Mathematics and Computing, 2020 In this paper, we study the Castelnuovo-Mumford regularity and the graded Betti numbers of the binomial edge ideals of some classes of graphs. Our special attention is devoted to a conjecture which asserts that the number of maximal cliques of a graph ...
Sara Saeedi Madani, Dariush Kiani
doaj +1 more source
EDGE IDEALS OF WEIGHTED GRAPHS [PDF]
Journal of Algebra and Its Applications, 2013 We study weighted graphs and their "edge ideals" which are ideals in polynomial rings that are defined in terms of the graphs. We provide combinatorial descriptions of m-irreducible decompositions for the edge ideal of a weighted graph in terms of the combinatorics of "weighted vertex covers". We use these, for instance, to say when these ideals are m-
Paulsen, Chelsey, Sather-Wagstaff, Sean
openaire +3 more sources
Journal of Algebraic Combinatorics, 2012 The paper under review is inspired by the question of for which graphs do all powers of the edge ideals have linear resolutions. It is known (cf. \textit{D. Eisenbud} et al., [Compos. Math. 141, No. 6, 1460--1478 (2005; Zbl 1086.14044)] and \textit{H.T. Hà} and \textit{A. Van Tuyl} [J. Algebra 309, No. 1, 405--425 (2007; Zbl 1151.13017)]) that the edge
Nevo, Eran, Peeva, Irena
openaire +1 more source
Koszul Binomial Edge Ideals [PDF]
, 2014 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 converse of this statement is proved for a class of chordal and claw free graphs.
Ene, Viviana +2 more
openaire +2 more sources
Sequentially Cohen-Macaulay edge ideals [PDF]
Proceedings of the American Mathematical Society, 2007 Let G be a simple undirected graph on n vertices, and let I(G) \subseteq R = k[x_1,...,x_n] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear.
Francisco, Christopher A. +1 more
openaire +2 more sources