New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}$ we correspond its circuit ideal $I(mathcal{C})$ generated by monomials $x_{i_1}cdots x_{i_k}$ with ${i_1,ldots,i_k}inmathcal{C}$. Conversely, to each square-free monomial ideal $I$ with minimal set of generators $mathcal{G}(I)$, we correspond a clutter with circuits ${i_1,ldots,i_k}$, where $x_{i_1}cdots x_{i_k}inmathcal{G}(I)$. The independence complex of a clutter $mathcal{C}$ on $[n]$ is the simplicial complex $Delta_{mathcal{C}}$ whose faces are independent sets in $mathcal{C}$ by which we mean sets $Fsubseteq [n]$ such that $ensubseteq F$ for all $einmathcal{C}$. It is easy to see that the Stanley-Reisner ideal of $Delta_{mathcal{C}}$ coincides with $I(mathcal{C})$. The above correspondence establishes a one-to-one correspondence between simplicial complexes and independence complex of clutters. A simplicial complex $Delta$ is shellable if there exists a total order on its facets, say $F_1