Matching Trees for Simplicial Complexes and Homotopy Type of Devoid Complexes of Graphs

Abstract

We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes. We then exemplify their efficiency on some simplicial complexes, the devoid complexes of graphs, $\mathcal {D}(G;\mathcal {F})$ whose faces are vertex subsets of G that induce $\mathcal {F}$ -free subgraphs, where G is a multigraph and $\mathcal {F}$ is a family of multigraphs. Additionally, we compute the homotopy type of dominance complexes of chordal graphs.