Related papers: Licci Property of Complementary Edge Ideals
The local complement G*i of a simple graph G at one of its vertices i is obtained by complementing the subgraph induced by the neighborhood of i and leaving the rest of the graph unchanged. If e={i,j} is an edge of G then G*e=((G*i)*j)*i is…
We compute the Betti numbers for all the powers of initial and final lexsegment edge ideals. For the powers of the edge ideal of an anti-$d-$path, we prove that they have linear quotients and we characterize the normally torsion-free…
In this article, we compute the regularity of Rees algebra of binomial edge ideals of closed graphs. We obtain a lower bound for the regularity of Rees algebra of binomial edge ideals. We also study some algebraic properties of the Rees…
This paper presents exact formulas for the regularity and depth of powers of edge ideals of an edge-weighted star graph. Additionally, we provide exact formulas for the regularity of powers of the edge ideal of an edge-weighted integrally…
Fr\"oberg's classical theorem about edge ideals with $2$-linear resolution can be regarded as a classification of graphs whose edge ideals have linearity defect zero. Extending his theorem, we classify all graphs whose edge ideals have…
We classify modules and rings with some specific properties of their intersection graphs. In particular, we describe rings with infinite intersection graphs containing maximal left ideals of finite degree. This answers a question raised in…
We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper…
Edge polytopes is a class of interesting polytope with rich algebraic and combinatorial properties, which was introduced by Ohsugi and Hibi. In this papar, we follow a previous study on cutting edge polytopes by Hibi, Li and Zhang. Instead…
In this article, we characterize all unmixed and Cohen-Macaulay parity binomial edge ideals of cactus and chordal graphs in terms of the structural properties of the graph.
We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most…
We extend results related to maximal subalgebras and ideals from Lie to Leibniz algebras. In particular, we classify minimal non-elementary Leibniz algebras and Leibniz algebras with a unique maximal ideal. In both cases, there are types of…
We study well-rounded lattices which come from ideals in quadratic number fields, generalizing some recent results of the first author with K. Petersen. In particular, we give a characterization of ideal well-rounded lattices in the plane…
In this paper, we study the componentwise linearity of powers of edge ideal of a weighted oriented graph $D$. We give a characterization for componentwise linearity of the edge ideal $I(D)$ in terms of forbidden subgraphs of $D$. If $D$ is…
Let $G$ be a finite graph on $[n]:=\{1, \ldots, n\}$ and $\kappa(G)$ its vertex connectivity. Let $S=K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I(G^c)$ the edge ideal of the complementary graph…
An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
In this paper, we introduce some reduction processes on graphs which preserve the regularity of related edge ideals. As a consequence, an alternative proof for the theorem of R. Fr\"oberg on linearity of resolution of edge ideal of graphs…
We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.
In this paper, we give a complete description of the associated primes of each power of the edge ideal of an increasing weighted tree.
Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Here, we define a unifying framework - probabilistic inductive…