Related papers: Non-ridge-chordal complexes whose clique complex h…
A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d<4. We solve the problem up…
Shellability of a simplicial complex has many useful structural implications. In particular, it was shown by Danaraj and Klee that every shellable pseudo-manifold is a PL-sphere. The purpose of this paper is to prove the shellability of the…
Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep…
In the paper we treat Gale diagrams in a combinatorial way. The interpretation allows to describe simplicial complexes which are Alexander dual to boundaries of simplicial polytopes and, more generally, to nerve-complexes of general…
In this paper we study the Alexander dual of a vertex decomposable simplicial complex. We define the concept of a vertex splittable ideal and show that a simplicial complex $\Delta$ is vertex decomposable if and only if $I_{\Delta^{\vee}}$…
One of the main open questions in liaison theory is whether every homogeneous Cohen-Macaulay ideal in a polynomial ring is glicci, i.e. if it is in the G-liaison class of a complete intersection. We give an affirmative answer to this…
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…
In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjecture is yet refuted by Lafond and Seamone in 2015. Given that…
In 1992, Thomas Bier introduced a surprisingly simple way to construct a large number of simplicial spheres. He proved that, for any simplicial complex $\Delta$ on the vertex set $V$ with $\Delta \ne 2^V$, the deleted join of $\Delta$ with…
Let $G$ be a graph and $r \ge 1$. A vertex subset is $r$-independent if every connected component of its induced subgraph has size at most $r$. The family of all such subsets forms a simplicial complex, the $r$-independence complex…
A recent pair of papers of Armstrong, Loehr, and Warrington and Armstrong, Williams, and the author initiated the systematic study of {\em rational Catalan combinatorics} which is a generalization of Fuss-Catalan combinatorics (which is in…
Ehrenborg, Govindaiah, Park, and Readdy recently introduced the van der Waerden complex, a pure simplicial complex whose facets correspond to arithmetic progressions. Using techniques from combinatorial commutative algebra, we classify when…
This paper uses dualities between facet ideal theory and Stanley-Reisner theory to show that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay. The proof involves showing that the Alexander dual (or the cover dual, as we…
We investigate the shellability of the polyhedral join $\mathcal{Z}^*_M (K, L)$ of simplicial complexes $K, M$ and a subcomplex $L \subset K$. We give sufficient conditions and necessary conditions on $(K, L)$ for $\mathcal{Z}^*_M (K, L)$…
Recently, a conjecture due to Hendry was disproved which stated that every Hamiltonian chordal graph is cycle extendible. Here we further explore the conjecture, showing that it fails to hold even when a number of extra conditions are…
A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani in 1987, via a non-constructive proof…
Whitehead aspherical conjecture says that every connected subcomplex of every aspherical 2-complex is aspherical. By an argument on ribbon sphere-links, it is confirmed that the conjecture is true for every contractible finite 2-complex. In…
In extremal graph theory, the problem of finding the elements of a given class of graphs which contain the most cliques traces its routes back to Tur\'an's famous theorem. We consider the implications of the connectivity property of…
We reprove and generalize in a combinatorial way the result of A. Bj\"orner [J.\ Comb.\ Th.\ A {\bf 30}, 1981, pp.~90--100, Theorem 3.3], that order complexes of noncomplemented lattices are contractible, namely by showing that these…
Suppose $\Delta$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n-d-1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of facets of $\Delta$ is at least $\binom{n}{c}-2c+1$,…