arXiv Analytics

Sign in

arXiv:0912.0720 [math.CO]AbstractReferencesReviewsResources

Independence Complexes of Stable Kneser Graphs

Benjamin Braun

Published 2009-12-03Version 1

For integers n\geq 1, k\geq 0, the stable Kneser graph SG_{n,k} (also called the Schrijver graph) has as vertex set the stable n-subsets of [2n+k] and as edges disjoint pairs of n-subsets, where a stable n-subset is one that does not contain any 2-subset of the form {i,i+1} or {1,2n+k}. The stable Kneser graphs have been an interesting object of study since the late 1970's when A. Schrijver determined that they are a vertex critical class of graphs with chromatic number k+2. This article contains a study of the independence complexes of SG_{n,k} for small values of n and k. Our contributions are two-fold: first, we find that the homotopy type of the independence complex of SG_{2,k} is a wedge of spheres of dimension two. Second, we determine the homotopy types of the independence complexes of certain graphs related to SG_{n,2}.

Related articles: Most relevant | Search more
arXiv:1007.0418 [math.CO] (Published 2010-07-02)
Star clusters in independence complexes of graphs
arXiv:1501.06754 [math.CO] (Published 2015-01-27)
Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs
arXiv:math/0508148 [math.CO] (Published 2005-08-08)
Complexes of Directed Trees and Independence Complexes