相关论文: Edge ideals with almost maximal finite index and t…

We study the Koszul property of a standard graded $K$-algebra $R$ defined by the binomial edge ideal of a pair of graphs $(G_1,G_2)$. We show that the following statements are equivalent: (i) $R$ is Koszul; (ii) the defining ideal…

Let $\Lambda$ be a numerical semigroup and $I\subset \Lambda$ be an ideal of $\Lambda$. The graph $G_I(\Lambda)$ assigned to an ideal $I$ of $\Lambda$ is a graph with elements of $(\Lambda \setminus I)^*$ as vertices and any two vertices…

We introduce the $k$-strong Lefschetz property ($k$-SLP) and the $k$-weak Lefschetz property ($k$-WLP) for graded Artinian $K$-algebras, which are generalizations of the Lefschetz properties. The main results obtained in this paper are as…

We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.

Let $S$ be the polynomial ring over a field $K$ in a finite set of variables, and let $ \mathfrak{m}$ be the graded maximal ideal of $S$. It is known that for a finitely generated graded $S$-module $M$ and all integers $k\gg 0$, the module…

Nearly complete intersection ideals were introduced by A. Boocher and J. Seiner (2018) and defines a special class of monomial ideals in a polynomial ring. These ideals were used to give a lower bound of the total sum of betti numbers that…

An independent dominating set of a graph, also known as a maximal independent set, is a set $S$ of pairwise non-adjacent vertices such that every vertex not in $S$ is adjacent to some vertex in $S$. We prove that for $\Delta=4$ or…

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…

In the present paper, we give a complete classification of connected simple graphs whose edge rings have a $q$-linear resolution with $q \geq 2$. In particular, we show that the edge ring of a finite connected simple graph with a $q$-linear…

Let $D$ be a weighted oriented graph with the underlying graph $G$ and $I(D), I(G) $ be the edge ideals corresponding to $D$ and $G$ respectively. We show that the regularity of edge ideal of a certain class of weighted oriented graph…

Let $R$ be a polynomial ring in $N$ variables over an arbitrary field $K$ and let $I$ be an ideal of $R$ generated by $n$ polynomials of degree at most 2. We show that there is a bound on the projective dimension of $R/I$ that depends only…

Edge ideals of graphs were introduced by Villarreal in 1990, and have been the subject of many studies since then. In the same year, Fr\"oberg characterized edge ideals with regularity 2 in combinatorial terms. This result was generalized…

For any graph $G$, assume that $J(G)$ is the cover ideal of $G$. Let $J(G)^{(k)}$ denote the $k$th symbolic power of $J(G)$. We characterize all graphs $G$ with the property that $J(G)^{(k)}$ has a linear resolution for some (equivalently,…

Let $G$ be a finite graph and $I(G)$ its edge ideal. We give a full description of the Stanley--Reisner complex of the polarization of $I(G)^2$, naturally introducing the tools of Stanley--Reisner theory in the study of the algebraic…

Let $R=k[x_1, ..., x_n]$ be a polynomial ring and let $I\subset R$ be a graded ideal. In \cite{R}, R\"{o}mer asked whether under the Cohen-Macaulay assumption the $i$-th Betti number $\beta_{i}(R/I)$ can be bounded above by a function of…

A graph is called $K$-almost regular if its maximum degree is at most $K$ times the minimum degree. Erd\H{o}s and Simonovits showed that for a constant $0< \varepsilon< 1$ and a sufficiently large integer $n$, any $n$-vertex graph with more…

A good edge-labelling of a simple graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. Say a graph is good if it admits a good…

Let W be an associative PI algebra over a field F of characteristic zero, graded by a finite group G. Let id_{G}(W) denote the T-ideal of G-graded identities of W. We prove: 1. {[G-graded PI equivalence]} There exists a field extension K of…

Let $G = (V(G), E(G))$ be a graph. The maximum cardinality of a set $M_k \subseteq E(G)$ such that $M_k$ contains exactly $k$-pairs of adjacent edges of $G$ is called the $k$-nearly edge independence number of $G$, and is denoted by…

In this paper, we investigate bounds for the following judicious $k$-partitioning problem: Given an edge-weighted graph $G$, find a $k$-partition $(V_1,V_2,\dots ,V_k)$ of $V(G)$ such that the total weight of edges in the heaviest induced…