Related papers: Regularity and $a$-invariant of Cameron--Walker gr…

Let $G$ be a simple graph and let $\nu(G)$ be the matching number of $G$. It is well-known that $\reg I(G) \leqslant \nu(G)+1$. In this paper we show that $\reg I(G) = \nu(G)+1$ if and only if every connected component of $G$ is either a…

Let G be a graph obtained by taking r>=2 paths and identifying all first vertices and identifying all the last vertices. We compute the Castelnuovo--Mumford regularity of the quotient S/I(X), where S is the polynomial ring on the edges of G…

The chromatic number $\chi$ of a graph is bounded from below by its clique number $\omega,$ but it can be arbitrary large. Perfect graphs are defined by $\chi=\omega$ for all induced subgraphs. An interesting relaxation are $\chi$-bounded…

The algebraic degree $Deg(G)$ of a graph $G$ is the dimension of the splitting field of the adjacency polynomial of $G$ over the field $\mathbb{Q}$. It can be shown that for every positive integer $d$, there exists a circulant graph with…

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…

Let $G$ be a simple graph on $n$ vertices. Let $L_G \text{ and } \mathcal{I}_G \: $ denote the Lov\'asz-Saks-Schrijver(LSS) ideal and parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots,…

Let $G$ be a connected simple graph on the vertex set $[n]$. Banerjee-Betancourt proved that $depth(S/J_G)\leq n+1$. In this article, we prove that if $G$ is a unicyclic graph, then the depth of $S/J_G$ is bounded below by $n$. Also, we…

Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…

Let $k\geq 3$ be an integer and $G$ be a very well-covered graph with ${\rm odd-girth}(G)\geq 2k+1$. Assume that $I(G)$ is the edge ideal of $G$. We show that for every integer $s$ with $1\leq s\leq k-2$, we have ${\rm…

Let $G$ be a finite graph on the vertex set $[d] = \{1, ..., d \}$ with the edges $e_1, ..., e_n$ and $K[\tb] = K[t_1, ..., t_d]$ the polynomial ring in $d$ variables over a field $K$. The edge ring of $G$ is the semigroup ring $K[G]$ which…

Let $G$ be a finite simple graph and $NI(G)$ be the closed neighborhood ideal of $G$ in the polynomial ring $S=K[V(G)]$. In this paper, we study the Castelnuovo-Mumford regularity, projective dimension and Cohen-Macaulayness of this ideal.…

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…

Let $G$ be a finite simple graph and let $NI(G)$ denote the closed neighborhood ideal of $G$ in a polynomial ring $R$. We show that if $G$ is a forest, then the Castelnuovo-Mumford regularity of $R/NI(G)$ is the same as the matching number…

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$.

Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…

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$.…

Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_{1}, \ldots, x_{n}\}$ and match$(G)$, min-match$(G)$ and ind-match$(G)$ the matching number, minimum matching number and induced matching number of $G$, respectively. Let…

Let $G$ be a simple graph and $I_3(G)$ be its $3$-path ideal in the corresponding polynomial ring $R$. In this article, we prove that for an arbitrary graph $G$, $reg(R/I_3(G))$ is bounded below by $2\nu_3(G)$, where $\nu_3(G)$ denotes the…

In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…

Let I be a homogeneous ideal of a polynomial ring S. We prove that if the initial ideal J of I, w.r.t. a term order on S, is square-free, then the extremal Betti numbers of S/I and of S/J coincide. In particular, depth(S/I)=depth(S/J) and…