Paths of homomorphisms from stable Kneser graphs

Details Paths of homomorphisms from stable Kneser graphs Paths of homomorphisms from stable Kneser graphs

2010-06-02

arxiv.org/abs/1006.0474v1

Mathematics

Combinatorics

7 pages

Scientific paper

We denote by SG_{n,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 n\ge2 we show that there is a component of the \chi-colouring graph of SG_{n,k} which is invariant under the action of the automorphism group of SG_{n,k}. We derive that there is a graph G with \chi(G)=\chi(SG_{n,k}) such that the complex Hom(SG_{n,k}, G) is non-empty and connected. In particular, for k congruent 3 (mod 4) and n\ge2 the graph SG_{n,k} is not a test graph.

Affiliated with

Also associated with

No associations

Rating

Paths of homomorphisms from stable Kneser graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Paths of homomorphisms from stable Kneser graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Paths of homomorphisms from stable Kneser graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-513478