Related papers: Cohen-Macaulay binomial edge ideals and accessible…

Given a simple undirected graph $G$ there is a simplicial complex $\mathrm{Ind}(G)$, called the independence complex, whose faces correspond to the independent sets of $G$. This is a well studied concept because it provides a fertile ground…

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

We graph-theoretically characterize triangle-free Gorenstein graphs $G$. As an application, we classify when $I(G)^2$ is Cohen-Macaulay.

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…

A graph $G$ is well-covered if it has no isolated vertices and all the maximal independent sets have the same cardinality. If furthermore two times this cardinality is equal to $|V(G)|$, the graph $G$ is called very well-covered. The class…

Monomial ideals which are generic with respect to either their generators or irreducible components have minimal free resolutions derived from simplicial complexes. For a generic monomial ideal, the associated primes satisfy a saturated…

In this paper we study almost Cohen-Macaulay bipartite graphs. Furthermore, we prove that if $G$ is almost Cohen-Macaulay bipartite graph with at least one vertex of positive degree, then there is a vertex of $\deg(v) \leq 2$. In…

In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove…

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

We extend the definition of chordal from graphs to clutters. The resulting family generalizes both chordal graphs and matroids, and obeys many of the same algebraic and geometric properties. Specifically, the independence complex of a…

For every simple graph $G$, a class of multiple clique cluster-whiskered graphs $G^{md}$ is introduced, and it is shown that all graphs $G^{md}$ are vertex decomposable, thus the independence simplicial complex ${\rm Ind}\,G^{md}$ is…

Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we prove that if $G$ is a fan graph of a complete graph, then…

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…

A graph is strongly even-cycle decomposable if the edge set of every subdivision with an even number of edges can be partitioned into cycles of even length. We prove that several fundamental composition operations that preserve the property…

Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gr\"obner bases and are radical if only if the graph is bipartite or the characteristic of the ground field is…

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if $D$ is a weighted oriented graph whose edge ideal $I(D)$ is componentwise linear, then the underlying simple graph $G$ of $D$ is…

The aim of this work is to study the v-number of edge ideals of clutters and graphs. We relate the v-number with the regularity of edge ideals and study the combinatorial structure of the graphs whose edge ideals have their second symbolic…

Let $G$ be an unmixed bipartite graph of dimension $d-1$. Assume that $K_{n,n}$, with $n\ge 2$, is a maximal complete bipartite subgraph of $G$ of minimum dimension. Then $G$ is Cohen-Macaulay in codimension $d-n+1$. This generalizes a…

In 2012, K. Matsuda introduced the class of weakly closed graphs and investigated when binomial edge ideals are F-pure. He proved that weakly closed binomial edge ideals are F-pure whenever the base field has positive characteristic. He…