Related papers: On The Generalized Binomial Edge Ideals of General…
This paper gives exact formulas for the regularity of edge ideals of edge-weighted integrally closed trees. In addition, we provide some linear upper bounds on the regularity of powers of such ideals.
The v-number of a graded ideal is an invariant recently introduced in the context of coding theory, particularly in the study of Reed--Muller-type codes. In this work, we study the localized v-numbers of a binomial edge ideal $J_G$…
Generalising the two-dimensional case, we provide estimates for the mean-values of the lengths of the edges of an integral box with given volume and minimal surface.
Let $G$ be a Cameron--Walker graph on $n$ vertices and $J_G$ the binomial edge ideal of $G$. Let $S$ denote the polynomial ring in $2n$ variables over a field. It is shown that the following conditions are equivalent: (i) $S/J_G$ is…
This paper gives some exact formulas for the depth of powers of the edge ideal of an edge-weighted integrally closed cycle.
We prove that the regularity cannot increase when taking the integral closure for edge ideals of arbitrary weighted oriented graphs.
We give a formula for the v-number of a graded ideal that can be used to compute this number. Then we show that for the edge ideal $I(G)$ of a graph $G$ the induced matching number of $G$ is an upper bound for the v-number of $I(G)$ when…
Let $G$ be a graph and let $I := I (G)$ be its edge ideal. In this paper, we provide an upper bound of $n$ from which $\depth R/ I(G)^n$ is stationary, and compute this limit explicitly. This bound is always achieved if $G$ has no cycles of…
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…
Let $G$ be a simple graph on the vertex set $V(G) = [n] = \{1,...,n\}$ and edge ideal $E(G)$. We consider the class of closed graphs. A closed graph is a simple graph satisfying the following property: for all edges $\{i, j\}$ and $\{k,…
In this paper we provide some precise formulas for regularity of powers of edge ideal of the disjoint union of some weighted oriented gap-free bipartite graphs. For the projective dimension of such an edge ideal, we give its exact formula.…
We get central limit type theorems for the total number of edges in the generalized random graphs with random vertex weights under different moment conditions on distributions of the weights.
In this paper, we characterize all graphs $G$ satisfying \[\operatorname{reg}(S/J_G)=\ell(G)=c(G)\] where $\ell(G)$ is the sum of the lengths of the longest induced paths in each connected component of $G$ and $c(G)$ is the number of the…
We show that the co-chordal cover number of a graph G gives an upper bound for the Castelnuovo-Mumford regularity of the associated edge ideal. Several known combinatorial upper bounds of regularity for edge ideals are then easy…
We determine the arithmetical rank of every edge ideal of a Ferrers graph.
Let $G$ be a finite simple graph on the vertex set $[n] = \{ 1, \ldots, n \}$ and $K[X, Y] = K[x_1, \ldots, x_n, y_1, \ldots, y_n]$ the polynomial ring in $2n$ variables over a field $K$ with each $\mathrm{deg} x_i = \mathrm{deg} y_j = 1$.…
In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an…
This paper gives exact formulas for the regularity of powers of edge ideals of an edge-weighted integrally closed cycle.
Let $G$ be a graph on $[n]$ and $J_G$ be the binomial edge ideal of $G$ in the polynomial ring $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$. In this paper we investigate some topological properties of a poset associated to the minimal…
In this paper we prove that if $I(G)$ is a bipartite edge ideal with regularity three then for all $s\geq 2$ the regularity of $I(G)^s$ is exactly $2s+1$.