Related papers: Chordal graphs, higher independence and vertex dec…

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…

Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no…

For $r\geq 1$, the $r$-independence complex of a graph $G$, denoted Ind$_r(G)$, is a simplicial complex whose faces are subsets $A \subseteq V(G)$ such that each component of the induced subgraph $G[A]$ has at most $r$ vertices. In this…

We introduce a new family of pure simplicial complexes, called the $r$-co-connected complex of $G$ with respect to $A$, $\Sigma_r(A,G)$, where $r\geq 1$ is a natural number, $G$ is a simple graph, and $A$ is a subset of vertices.…

For $r\geq 1$, the $r$-independence complex of a graph $G$ is a simplicial complex whose faces are subset $I \subseteq V(G)$ such that each component of the induced subgraph $G[I]$ has at most $r$ vertices. In this article, we determine the…

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…

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…

This paper investigates the shellability of $r$-independence complexes $\mathcal{I}_r(G)$, a generalization of classical independence complexes introduced by Paolini and Salvetti. For a graph $G$, a subset $A \subseteq V(G)$ is…

Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of…

Let $G$ be a finite simple graph on a vertex set $V(G)=\{x_{11}, \ldots, x_{n1}\}$. Also let $m_1, \ldots,m_n \geq 2$ be integers and $G_1, \ldots, G_n$ be connected simple graphs on the vertex sets $V(G_i)=\{x_{i1}, \ldots, x_{im_i}\}$. In…

The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…

We study combinatorial and algebraic properties of $t$-clique-free complexes, a family of simplicial complexes associated with finite simple graphs that generalize the classical independence complex. For a graph $G$ and an integer $t \ge…

Let G be a bipartite graph with edge ideal I(G) whose quotient ring R/I(G) is sequentially Cohen-Macaulay. We prove: (1) the independence complex of G must be vertex decomposable, and (2) the Castelnuovo-Mumford regularity of R/I(G) can be…

Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We…

Let $D$ be a multidigraph. We study the simplicial complex $\mathrm{Dlf}(D)$, whose vertices are the directed edges of $D$ and whose faces correspond to directed linear forests, that is, vertex-disjoint unions of directed paths. We also…

The independence complex of a graph G is a simplicial complex whose simplices are the independent sets in G. In the last couple of decades, the independence complexes of square grids (with various boundary conditions) have gained much…

We study the independence complexes of families of well-covered circulant graphs discovered by Boros-Gurvich-Milani\v{c}, Brown-Hoshino, and Moussi. Because these graphs are well-covered, their independence complexes are pure simplicial…

Let $G$ be a graph on $V$. A vertex subset $S \subset V$ is called a cover of $G$ if its complement is an independent set, and $S$ is called a noncover if it is not a cover of $G$. A noncover complex $NC(G)$ of $G$ is the simplicial complex…

We introduce sequentially $S_r$ modules over a commutative graded ring and sequentially $S_r$ simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying…

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…