pith. sign in

arxiv: 0912.0720 · v1 · submitted 2009-12-03 · 🧮 math.CO · math.AT

Independence Complexes of Stable Kneser Graphs

classification 🧮 math.CO math.AT
keywords stablegraphsindependencecomplexesknesergraphhomotopyn-subsets
0
0 comments X
read the original abstract

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}.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Representing Higher-Order Networks: A Survey of Graph-Based Frameworks

    cs.SI 2026-03 unverdicted novelty 4.0

    A comprehensive survey of graph-based frameworks for higher-order networks, covering foundational concepts, extensions, and newly introduced formalisms with emphasis on structural principles and applications.

  2. Representing Higher-Order Networks: A Survey of Graph-Based Frameworks

    cs.SI 2026-03 unverdicted novelty 2.0

    A comprehensive survey of graph-based formalisms for higher-order networks including multiway, hierarchical, temporal, multilayer, recursive, and tensor-based models.