Related papers: Geometrically vertex decomposable open neighborhoo…

We recall a numerical criteria for Cohen--Macaulayness related to system of parameters, and introduce monomial ideals of K\"onig type which include the edge ideals of K\"onig graphs. We show that a monomial ideal is of K\"onig type if and…

We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…

We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem…

Inspired by the definition of $\bf{t}$-spread monomial ideals, in this paper, we introduce $\bf{t}$-spread $d$-partite hypergraph $K^{\bf t}_V$ and study its edge ideal $I(K^{\bf t}_V)$. We prove that $I(K^{\bf t}_V)$ has linear quotients,…

We show that the independence complex of a chordal graph is contractible if and only if this complex is dismantlable (strong collapsible) and it is homotopy equivalent to a sphere if and only if its core is a cross-polytopal sphere. The…

We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…

We show that if $X$ is an indecomposable $PD_3$-complex and $\pi_1(X) is the fundamental group of a reduced finite graph of finite groups but is not virtually cyclic then $X$ is orientable, the underlying graph is a tree, all the edge…

All Cohen--Macaulay polymatroidal ideals are classified. The Cohen--Macaulay polymatroidal ideals are precisely the principal ideals, the Veronese ideals, and the squarefree Veronese ideals.

This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…

Given a vertex-weighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which…

In this article, we characterize all trees whose highest non-vanishing squarefree power of the closed neighborhood ideal is componentwise linear. In addition, we investigate the Castelnuovo-Mumford regularity of the $\nu$-th squarefree…

Let $D$ be a weighted oriented graph, whose underlying graph is $G$, and let $I(D)$ be its edge ideal. If $G$ has no $3$-, $5$-, or $7$-cycles, or $G$ is K\"{o}nig, we characterize when $I(D)$ is unmixed. If $G$ has no $3$- or $5$-cycles,…

Scattered over the past few years have been several occurrences of simplicial complexes whose topological behavior characterize the Cohen-Macaulay property for quotients of polynomial rings by arbitrary (not necessarily squarefree) monomial…

We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications,…

In this paper, our main focus is to explore different classes of nearly normally torsion-free ideals. We first characterize all finite simple connected graphs with nearly normally torsion-free cover ideals. Next, we characterize all…

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…

For a finite simple graph $G$ and an integer $r \ge 1$, the $r$-connected ideal $I_r(G)$ is the squarefree monomial ideal generated by the vertex sets of connected induced subgraphs of size $r+1$, extending the classical edge ideal. We…

A monomial ideal $I$ is said to have homological linear quotients if for each $k\geq 0$, the homological shift ideal $\mathrm{HS}_k(I)$ has linear quotients. It is a well-known fact that if an edge ideal $I(G)$ has homological linear…

We prove a conjecture of Sintiari and Trotignon that every even-hole-free graph of sufficiently large treewidth contains a four-vertex induced subgraph with at least five edges (that is, either the four-vertex complete graph or the unique…

A locally irregular graph is a graph whose adjacent vertices have distinct degrees. It was conjectured that every connected graph is edge decomposable to $3$ locally irregular subgraphs, unless it belongs to a certain family of exceptions,…