Paths of homomorphisms from stable Kneser graphs

Abstract

We denote by SGn,k the stable Kneser graph (Schrijver graph) of stable n-subsets of a set of cardinality 2n+k. For k congruent 3 (mod 4) and n2 we show that there is a component of the -colouring graph of SGn,k which is invariant under the action of the automorphism group of SGn,k. We derive that there is a graph G with (G)=(SGn,k) such that the complex Hom(SGn,k, G) is non-empty and connected. In particular, for k congruent 3 (mod 4) and n2 the graph SGn,k is not a test graph.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…