Historically, commutative algebra, whose foundations were laid by Dedekind, Hilbert,
Noether, and Krull, has developed in step with algebraic geometry, number theory …

REGULARITY BOUNDS FOR BINOMIAL EDGE IDEALS 1. Introduction. Let G be a simple
graph on the vertex set [n] = {1, 2,... ,n}. The b Page 1 JOURNAL OF COMMUTATIVE …

The Castelnuovo–Mumford regularity of binomial edge ideals - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

We study the regularity of binomial edge ideals. For a closed graph G we show that the
regularity of the binomial edge ideal coincides with the regularity of and can be expressed in …

In this article, we obtain an upper bound for the Castelnuovo-Mumford regularity of powers
of an ideal generated by a homogeneous quadratic sequence in a polynomial ring in terms …

arXiv:1802.06020v1 [math.AC] 16 Feb 2018 Page 1 arXiv:1802.06020v1 [math.AC] 16 Feb
2018 ON THE EXTREMAL BETTI NUMBERS OF BINOMIAL EDGE IDEALS OF BLOCK …

Let G be a finite simple graph on n vertices and JG denote the corresponding binomial edge
ideal in S= K [x 1,…, xn, y 1,…, yn]. We compute the Castelnuovo-Mumford regularity of S/JG …

In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a
graph G, we define the invariant η (G) as the maximum size of a clique disjoint edge set in G …

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 …

We prove that the regularity of binomial edge ideals of graphs obtained by gluing two graphs
at a free vertex is the sum of the regularity of individual graphs. As a consequence, we …