相关论文: Regularity and h-polynomials of toric ideals of gr…

For every natural number $d$, we construct finite $d$-regular simple graphs that, for every $r \le d$, contain an independent exact $r$-cover. This answers a question of Gray and Johnson that arose in their study of 2-step transit…

We study the regularity of symbolic powers of square-free monomial ideals. We prove that if $I = I_\Delta$ is the Stanley-Reisner ideal of a simplicial complex $\Delta$, then $\reg(I^{(n)}) \leqslant \delta(n-1) +b$ for all $n\geqslant 1$,…

By using the Szemer\'edi Regularity Lemma, Alon and Sudakov recently extended the classical Andr\'asfai-Erd\~os-S\'os theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is…

The purpose of this paper is to give a simple geometric construction of ideals whose Castelnuovo-Mumford regularity is large compared to the generating degree. Moreover, our ideals have the property that the Castelnuovo-Mumford regularity…

Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…

Since the introduction of binomial edge ideals $J_{G}$ by Herzog et al. and independently Ohtani, there has been significant interest in relating algebraic invariants of the binomial edge ideal with combinatorial invariants of the…

Among other things, it is shown that for every pair of positive integers $r$, $d$, satisfying $1<r<d\leq 2r$, and every finite simple graph $H,$ there is a connected graph $G$ with diameter $d$, radius $r$, and center $H.$

Let $G$ be a Cameron--Walker graph on $n$ vertices and $J_G$ the binomial edge ideal of $G$. Let $S$ denote the polynomial ring in $2n$ variables over a field. It is shown that the following conditions are equivalent: (i) $S/J_G$ is…

For an $n \times n$ matrix $A$, let $q(A)$ be the number of distinct eigenvalues of $A$. If $G$ is a connected graph on $n$ vertices, let $\mathcal{S}(G)$ be the set of all real symmetric $n \times n$ matrices $A=[a_{ij}]$ such that for…

We give a combinatorial characterisation of connected graphs whose binomial edge ideals are of K\"{o}nig type, developed independently to the similar characterisation given by LaClair in arXiv:2304.13299, and exhibit some classes of graphs…

The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…

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 $V$ and let $I_G$ denote its edge ideal in the polynomial ring $S=\mathbb{K}[x_V]$. In this paper, we compute the depth and the Castelnuovo--Mumford regularity of $S/I_G$ when…

We develop a multigraded variant of Castelnuovo-Mumford regularity. Motivated by toric geometry, we work with modules over a polynomial ring graded by a finitely generated abelian group. As in the standard graded case, our definition of…

Let $G$ be a finite simple graph, and $J_G$ denote the binomial edge ideal of $G$. In this article, we first compute the $\mathrm{v}$-number of binomial edge ideals corresponding to Cohen-Macaulay closed graphs. As a consequence, we obtain…

The {\it total irregularity} of a simple undirected graph $G$ is defined as ${\rm irr}_t(G) =$ $\frac{1}{2}\sum_{u,v \in V(G)}$ $\left| d_G(u)-d_G(v) \right|$, where $d_G(u)$ denotes the degree of a vertex $u \in V(G)$. Obviously, ${\rm…

We study the Castelnuovo-Mumford regularity of powers of edge ideals. We prove that if G is a bipartite graph, then reg(I(G)^s) \leq 2s + reg I(G) - 2 for all s \geq 2, which is the best possible upper bound for any s. Suspension plays a…

We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs…

In the present paper, we characterize all possible Hilbert functions of graded ideals in a polynomial ring whose regularity is smaller than or equal to $d$, where $d$ is a positive integer. In addition, we prove the following result which…

Let $G$ be a simple graph on $d$ vertices. We define a monomial ideal $K$ in the Stanley-Reisner ring $A$ of the order complex of the Boolean algebra on $d$ atoms. The monomials in $K$ are in one-to-one correspondence with the proper…