Independence complexes of stable Kneser graphs
The electronic journal of combinatorics, Tome 18 (2011) no. 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 prove 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}$.
@article{10_37236_605,
author = {Benjamin Braun},
title = {Independence complexes of stable {Kneser} graphs},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/605},
zbl = {1217.05174},
url = {http://geodesic.mathdoc.fr/articles/10.37236/605/}
}
Benjamin Braun. Independence complexes of stable Kneser graphs. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/605
Cité par Sources :