Related papers: An Efficient Algebraic Criterion for Shellability

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…

In this paper we show that a $k$-shellable simplicial complex is the expansion of a shellable complex. We prove that the face ring of a pure $k$-shellable simplicial complex satisfies the Stanley conjecture. In this way, by applying…

Let $\Phi$ be a finite root system of rank $n$ and let $m$ be a nonnegative integer. The generalized cluster complex $\Delta^m (\Phi)$ was introduced by S. Fomin and N. Reading. It was conjectured by these authors that $\Delta^m (\Phi)$ is…

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…

We recall first Gallai-simplicial complex $\Delta_{\Gamma}(G)$ associated to Gallai graph $\Gamma(G)$ of a planar graph $G$. The Euler characteristic is a very useful topological and homotopic invariant to classify surfaces. In Theorems 3.2…

A numerical characterization is given of the so-called h-triangles of sequentially Cohen-Macaulay simplicial complexes. This result characterizes the number of faces of various dimensions and codimensions in such a complex, generalizing the…

Let $\mathcal{C}$ be a clutter with a perfect matching $e_1,...,e_g$ of K\"onig type and let $\Delta_\mathcal{C}$ be the Stanley-Reisner complex of the edge ideal of $\mathcal{C}$. If all c-minors of $\mathcal{C}$ have a free vertex and…

We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially Cohen-Macaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes.

Let G be a simple undirected graph on n vertices, and let I(G) \subseteq R = k[x_1,...,x_n] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the…

Let $\D$ be a $(d-1)$-dimensional pure $f$-simplicial complex over vertex set $[n]$. In this paper, it is proved that $n=2d$ holds true if $\D$ is minimal Cohen-Macaulay. It is also indicated that the recent work of \cite{Dao2020} implies…

We show that the facet-ridge graph of a shellable simplicial sphere $\Delta$ uniquely determines the entire combinatorial structure of $\Delta$. This generalizes the celebrated result due to Blind and Mani (1987), and Kalai (1988) on…

Let $I(\Delta)^{[k]}$ denote the $k^{\text{th}}$ square-free power of the facet ideal of a simplicial complex $\Delta$ in a polynomial ring $R$. Square-free powers are intimately related to the `Matching Theory' and `Ordinary Powers'. In…

For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the…

Let $G$ be a finite simple graph with edge ideal $I(G)$. For $q\ge 1$, the $q$-th squarefree power $I(G)^{[q]}$ is generated by products of $q$ pairwise disjoint edges of $G$. It is the Stanley-Reisner ideal of a simplicial complex…

To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…

Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex…

Let $G=(V,E)$ be a graph. If $G$ is a K\"onig graph or $G$ is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: $\Delta_{G}$ is pure shellable, $R/I_{\Delta}$ is Cohen-Macaulay, $G$ is unmixed…

For a property $\cal P$ of simplicial complexes, a simplicial complex $\Gamma$ is an obstruction to $\cal P$ if $\Gamma$ itself does not satisfy $\cal P$ but all of its proper restrictions satisfy $\cal P$. In this paper, we determine all…

We consider a $q$-analogue of abstract simplicial complexes, called $q$-complexes, and discuss the notion of shellability for such complexes. It is shown that $q$-complexes formed by independent subspaces of a $q$-matroid are shellable.…

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…