Higher Independence Complexes of graphs and their homotopy types
Algebraic Topology
2021-02-02 v2 Combinatorics
Abstract
For , the -independence complex of a graph is a simplicial complex whose faces are subset such that each component of the induced subgraph has at most vertices. In this article, we determine the homotopy type of -independence complexes of certain families of graphs including complete -partite graphs, fully whiskered graphs, cycle graphs and perfect -ary trees. In each case, these complexes are either homotopic to a wedge of equi-dimensional spheres or are contractible. We also give a closed form formula for their homotopy types.
Keywords
Cite
@article{arxiv.2001.05448,
title = {Higher Independence Complexes of graphs and their homotopy types},
author = {Priyavrat Deshpande and Anurag Singh},
journal= {arXiv preprint arXiv:2001.05448},
year = {2021}
}