Related papers: Binomial Edge Ideals of Generalized block graphs

A set of edges $X\subseteq E(G)$ of a graph $G$ is an edge general position set if no three edges from $X$ lie on a common shortest path. The edge general position number ${\rm gp}_{\rm e}(G)$ of $G$ is the cardinality of a largest edge…

Let $G$ be a simple undirected graph. The regular number of $G$ is defined to be the minimum number of subsets into which the edge set of $G$ can be partitioned so that the subgraph induced by each subset is regular. In this work, we obtain…

Given a finite simple graph one can associate the edge ideal. In this paper we prove that a graded Betti number of the edge ideal does not vanish if the original graph contains a set of complete bipartite subgraphs with some conditions.…

When M is a finitely generated graded module over a standard graded algebra S and I is an ideal of S, it is known from work of Cutkosky, Herzog, Kodiyalam, R\"omer, Trung and Wang that the Castelnuovo-Mumford regularity of I^mM has the form…

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper we prove that if $G$ is a very well-covered graph then for all $s \geq 2$ the regularity of $I(G)^s$ is exactly $2s+\nu(G)-1$.

We calculate the minimal attached primes of the local cohomology modules of the binomial edge ideals of block graphs. In particular, we obtain a combinatorial characterisation of which of these modules are non-vanishing. We also show that…

This work establishes combinatorial bounds on the Castelnuovo-Mumford regularity of edge ideals for trees and their multi-whiskered variants. For a tree \( T \), we give bounds for the Castelnuovo-Mumford regularity of \( I(T) \) in terms…

We investigate the analytic spread of binomial edge ideals of finite simple graphs. We provide tight bounds for this invariant in general. For special families of graphs (e.g., closed graphs, pseudo-forests), we compute the exact value for…

Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in the polynomial ring $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we compute the Hilbert series of binomial edge…

Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…

Let $G$ be a simple graph with $2n$ vertices and a perfect matching. We denote by $f(G)$ and $F(G)$ the minimum and maximum forcing number of $G$, respectively. Hetyei obtained that the maximum number of edges of graphs $G$ with a unique…

We study powers of binomial edge ideals associated with closed and block graphs.

We associate to every graph a linear program for packings of vertex disjoint paths. We show that the optimal primal and dual values of the corresponding integer program are the binomial grade and height of the binomial edge ideal of the…

We prove that when a Lozin's transformation is applied to a graph, the (Castelnuovo-Mumford) regularity of the graph increases exactly by one, as it happens to its induced matching number. As a consequence, we show that the regularity of a…

We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…

Let I(G) be the edge ideal associated to a simple graph G. We study the graded Betti numbers that appear in the linear strand of the minimal free resolution of I(G).

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…

A combinatorial property that characterizes Cohen-Macaulay binomial edge ideals has long been elusive. A recent conjecture ties the Cohen-Macaulayness of a binomial edge ideal $J_G$ to special disconnecting sets of vertices of its…

Several algebraic properties of a binomial edge ideal $J_G$ can be interpreted in terms of combinatorial properties of its associated graph $G$. In particular, the so-called cut sets of a graph $G$, special sets of vertices that disconnect…

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…