Related papers: Eulerian ideals
In this paper, we explain the regularity, projective dimension and depth of edge ideal of some classes of graphs in terms of invariants of graphs. We show that for a $C_5$-free vertex decomposable graph $G$, $\T{reg}(R/I(G))= c_G$, where…
Binomial edge ideals IG of a graph G were introduced by [4]. They found some classes of graphs G with the property that IG is a Cohen-Macaulay ideal. This might happen only for few classes of graphs. A certain generalization of being…
In this paper we study the Castelnuovo-Mumford regularity of the path ideals of finite simple graphs. We find new upper bounds for various path ideals of gap free graphs. In particular we prove that the path ideals of gap free and claw…
When I is an ideal of a standard graded algebra S with homogeneous maximal ideal \mm, it is known by the work of several authors that the Castelnuovo-Mumford regularity of I^m ultimately becomes a linear function dm + e for m \gg 0. We give…
Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…
When $I$ is the edge ideal of a graph $G$, we use combinatorial properities, particularly Property $P$ on connectivity of neighbors of an edge, to classify when a binomial sum of vertices is a regular element on $R/I(G)$. Under a mild…
Let (P,<) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. We prove that…
We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a…
Inspired by the notion of K\"onig graphs we introduce graded ideals of K\"onig type with respect to a monomial order $<$. It is shown that if $I$ is of K\"onig type, then the Cohen--Macaulay property of $\ini_<(I)$ does not depend on the…
Let X\subset PP^n be a projective scheme over a field, and let phi:X --> Y be a finite morphism. Our main result is a formula in terms of global data for the maximum of the Castelnuovo-Mumford regularity of the fibers of \phi, considered as…
Let $S = K[x_1,..., x_n]$ be a polynomial ring over a field $K$. Let $I(G) \subseteq S$ denote the edge ideal of a graph $G$. We show that the $\ell$th symbolic power $I(G)^{(\ell)}$ is a Cohen-Macaulay ideal (i.e., $S/I(G)^{(\ell)}$ is…
This paper analyzes the cohomological dimension of the generalized binomial edge ideal $\calJ_{K_m,G}$ for a complete $r$-partite graph $G$. Additionally, the Krull dimension, the depth, the Castelnuovo--Mumford regularity, the Hilbert…
We study the relation between the bigraded Castelnuovo-Mumford regularity of a bihomogeneous ideal $I$ in the coordinate ring of the product of two projective spaces and the bidegrees of a Gr\"obner basis of $I$ with respect to the degree…
We study the topology of the lcm-lattice of edge ideals and derive upper bounds on the Castelnuovo-Mumford regularity of the ideals. In this context it is natural to restrict to the family of graphs with no induced 4-cycle in their…
Some recent investigations indicate that for the classification of Cohen-Macaulay binomial edge ideals, it suffices to consider biconnected graphs with some whiskers attached (in short, `block with whiskers'). This paper provides explicit…
Castelnuovo-Mumford regularity is an important invariant of projective algebraic varieties. A well known conjecture due to Eisenbud and Goto gives a bound for regularity in terms of the codimension and degree,i.e., Castelnuovo-Mumford…
In this paper, we study the geometry of $GT-$varieties $X_{d}$ with group a finite cyclic group $\Gamma \subset \mathrm{GL}(n+1,\mathbb{K})$ of order $d$. We prove that the homogeneous ideal $\mathrm{I}(X_{d})$ of $X_{d}$ is generated by…
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…
Let $G$ be a finite simple graph on $[n]$ and $I(G) \subset S$ the edge ideal of $G$, where $S = K[x_{1}, \ldots, x_{n}]$ is the polynomial ring over a field $K$. Let $m(G)$ denote the maximum size of matchings of $G$ and $im(G)$ that of…
We introduce the abstract notion of squarefree-power-like functions, which unify the sequences of squarefree ordinary and symbolic powers of squarefree monomial ideals. By employing the Tor-vanishing criteria for mixed sums of ideals, we…