Related papers: Koszul binomial edge ideals

The $N$-Koszul algebras are $N$-homogeneous algebras which satisfy an homological property. These algebras are characterised by their Koszul complex: an $N$-homogeneous algebra is $N$-Koszul if and only if its Koszul complex is acyclic.…

We associate to a good cell decomposition of a manifold M a quadratic algebra and show that the Koszulity of the algebra implies a restriction on the Euler characteristic of M. For a two-dimensional manifold M the algebra is Koszul if and…

We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases it can be improved.…

The graded M\"{o}bius algebra of a matroid is a commutative graded algebra which encodes the combinatorics of the lattice of flats of the matroid. As a special subalgebra of the augmented Chow ring of the matroid, it plays an important role…

Let $G$ be a simple graph on $n$ vertices and $J_G$ denote 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 article, we compute the second graded Betti numbers of $J_G$, and…

The paper is devoted to graded algebras having a single homogeneous relation. Using Gerasimov's theorem, a criterion to be N-Koszul is given, providing new examples. An alternative proof of Gerasimov's theorem for N=2 is given. Some related…

It is well-known that eigenvalues of graphs can be used to describe structural properties and parameters of graphs. A theorem of Nosal states that if $G$ is a triangle-free graph with $m$ edges, then $\lambda (G)\le \sqrt{m}$, equality…

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 study Koszul homology over Gorenstein rings. If an ideal is strongly Cohen-Macaulay, the Koszul homology algebra satisfies Poincar\'e duality. We prove a version of this duality which holds for all ideals and allows us to give two…

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 an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E'$ of edges of $G$ is an edge dominating set of $G$, if every edge of the graph is dominated by some edge of $E'$. We say that $E'$ is…

The Koszul homology algebra of a commutative local (or graded) ring $R$ tends to reflect important information about the ring $R$ and its properties. In fact, certain classes of rings are characterized by the algebra structure on their…

In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with a subset of the integers ranging from 0 to m inclusive, such that no two vertices share a label, and each edge is uniquely identified by the…

In this paper, we prove that every binomial ideal in a polynomial ring over an algebraically closed field of characteristic zero admits a canonical primary decomposition into binomial ideals. Moreover, we prove that this special…

Let $G$ be a cycle or a complete bipartite graph. We show that the binomial edge ideal $J_{G}$ and its initial ideal with respect to the lexicographic order have the same extremal Betti number.

A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight.…

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…

The Koszul dual of locally finite non-positive dg algebra is locally finite positive dg algebra. However, the Koszul dual of locally finite positive dg algebra is not necessary locally finite. We characterize locally finite positive dg…

In an attempt to understanding the complexity of the independent set problem, Chv{\'a}tal defined t-perfect graphs. While a full characterization of this class is still at large, progress has been achieved for claw-free graphs [Bruhn and…

Given a 3-uniform hypergraph H, its 2-intersection graph G has for vertex set the hyperedges of H and ee' is an edge of G whenever e and e' have exactly two common vertices in H. Di Marco et al. prove that deciding wether a graph G is the…