Independence complexes of stable kneser graphs

14Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

For integers n ≥ 1, k ≥ 0, the stable Kneser graph SGn,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 SGn,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 SG2,k is a wedge of spheres of dimension two. Second, we determine the homotopy types of the independence complexes of certain graphs related to SGn,2.

Cite

CITATION STYLE

APA

Braun, B. (2011). Independence complexes of stable kneser graphs. Electronic Journal of Combinatorics, 18(1), 1–17. https://doi.org/10.37236/605

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free