arXiv:1007.0418 [math.CO]AbstractReferencesReviewsResources
Star clusters in independence complexes of graphs
Published 2010-07-02Version 1
We introduce the notion of \textit{star cluster} of a simplex in a simplicial complex. This concept provides a general tool to study the topology of independence complexes of graphs. We use star clusters to answer a question arisen from works of Engstr\"om and Jonsson on the homotopy type of independence complexes of triangle-free graphs and to investigate a large number of examples which appear in the literature. We present an alternative way to study the chromatic number of a graph from a homotopical point of view and obtain new results regarding the connectivity of independence complexes.
Comments: 22 pages, 13 figures
Related articles: Most relevant | Search more
arXiv:0912.0720 [math.CO] (Published 2009-12-03)
Independence Complexes of Stable Kneser Graphs
arXiv:1501.06754 [math.CO] (Published 2015-01-27)
Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs
arXiv:1905.06926 [math.CO] (Published 2019-05-16)
Homotopy Type of Independence Complexes of Certain Families of Graphs