Higher independence complexes of graphs and their homotopy types

From MaRDI portal
Publication:5003757




Abstract: For rgeq1, the r-independence complex of a graph G is a simplicial complex whose faces are subset IsubseteqV(G) such that each component of the induced subgraph G[I] has at most r vertices. In this article, we determine the homotopy type of r-independence complexes of certain families of graphs including complete s-partite graphs, fully whiskered graphs, cycle graphs and perfect m-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.




Cited in
(26)


Describes a project that uses

Uses Software





This page was built for publication: Higher independence complexes of graphs and their homotopy types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5003757)