English
Related papers

Related papers: Powers of Edge Ideals with Linear Quotients

200 papers

We introduce the abstract notion of squarefree-power-like functions, which unify the sequences of squarefree ordinary and symbolic powers of squarefree monomial ideals. By employing the Tor-vanishing criteria for mixed sums of ideals, we…

Commutative Algebra · Mathematics 2025-10-17 Trung Chau , Kanoy Kumar Das , Amit Roy , Kamalesh Saha

In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of…

We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear…

Combinatorics · Mathematics 2013-08-07 David Cook

We prove that $\beta_p(I(G)) = \beta_{p,p+r}(I(G))$ for skew Ferrers graph $G$, where $p:=\pd(I(G))$ and $r:=\reg(I(G))$. As a consequence, we confirm that Ene, Herzog and Hibi's conjecture is true for the Betti numbers in the last columm…

Commutative Algebra · Mathematics 2018-06-07 Do Trong Hoang

We prove several cases of the Betti number conjecture for the binomial edge ideal $J_G$ of a proper interval graph $G$ (also known as closed graph). Namely, we show that this conjecture is true for the linear strand of $J_G$, and true in…

Commutative Algebra · Mathematics 2016-12-01 Herolistra Baskoroputro

To a matroid M with n edges, we associate the so-called facet ideal F(M) generated by monomials corresponding to bases of M. We show that the Betti numbers related to an N-graded minimal free resolution of F(M) are determined by the Betti…

Combinatorics · Mathematics 2016-02-03 Trygve Johnsen , Jan Nyquist Roksvold , Hugues Verdure

In the present paper, we aim to classify monomial ideals whose all matching powers are Cohen-Macaulay. We especially focus our attention on edge ideals. The Cohen-Macaulayness of the last matching power of an edge ideal is characterized,…

Commutative Algebra · Mathematics 2025-04-25 Antonino Ficarra , Somayeh Moradi

We study the topology of the lcm-lattice of edge ideals and derive upper bounds on the Castelnuovo-Mumford regularity of the ideals. In this context it is natural to restrict to the family of graphs with no induced 4-cycle in their…

Combinatorics · Mathematics 2009-09-16 Eran Nevo

We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. We also provide examples of oriented graphs which have unmixed and non-Cohen-Macaulay vertex-weighted edge ideals, while the edge ideal of…

Commutative Algebra · Mathematics 2020-03-30 Seyed Amin Seyed Fakhari , Kosuke Shibata , Naoki Terai , Siamak Yassemi

We survey research relating algebraic properties of powers of squarefree monomial ideals to combinatorial structures. In particular, we describe how to detect important properties of (hyper)graphs by solving ideal membership problems and…

Commutative Algebra · Mathematics 2013-03-28 Christopher A. Francisco , Huy Tai Ha , Jeffrey Mermin

Let $G$ be a graph and let $I$ be the edge ideal of $G$. Our main results in this article provide lower bounds for the depth of the first three powers of $I$ in terms of the diameter of $G$. More precisely, we show that $\depth R/I^t \geq…

Commutative Algebra · Mathematics 2015-05-21 Louiza Fouli , Susan Morey

We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…

Commutative Algebra · Mathematics 2020-11-17 Peter Phelan

Hibi conjectured that if a toric ideal has a quadratic Gr\"obner basis, then the toric ideal has either a lexicographic or a reverse lexicographic quadratic Gr\"obner basis. In this paper, we present a cut ideal of a graph that serves as a…

Commutative Algebra · Mathematics 2019-12-11 Ryuichi Sakamoto

Inspired by the notion of K\"onig graphs we introduce graded ideals of K\"onig type with respect to a monomial order $<$. It is shown that if $I$ is of K\"onig type, then the Cohen--Macaulay property of $\ini_<(I)$ does not depend on the…

Commutative Algebra · Mathematics 2021-03-16 Jürgen Herzog , Takayuki Hibi , Somayeh Moradi

In this paper, we investigate some properties of symbolic powers and symbolic Rees algebras of binomial edge ideals associated with some classes of block graphs. First, it is shown that symbolic powers of binomial edge ideals of pendant…

Commutative Algebra · Mathematics 2024-09-17 Iman Jahani , Shamila Bayati , Farhad Rahmati

In this paper we study irreducible representations and symbolic Rees algebras of monomial ideals. Then we examine edge ideals associated to vertex-weighted oriented graphs. These are digraphs having no oriented cycles of length two with…

Commutative Algebra · Mathematics 2018-10-23 Philippe Gimenez , Jose Martínez-Bernal , Aron Simis , Rafael H. Villarreal , Carlos E. Vivares

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

Commutative Algebra · Mathematics 2025-05-06 Marie Amalore Nambi , Neeraj Kumar

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal in a polynomial ring over a field $\mathbb{K}$. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of symbolic powers of certain…

Commutative Algebra · Mathematics 2021-08-20 Arvind Kumar , S Selvaraja

We study basic properties of monomial ideals with linear quotients. It is shown that if the monomial ideal $I$ has linear quotients, then the squarefree part of $I$ and each component of $I$ as well as $\mm I$ have linear quotients, where…

Commutative Algebra · Mathematics 2007-07-20 Ali Soleyman Jahan , Xinxian Zheng

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…

Combinatorics · Mathematics 2026-05-12 Alexander Engström