vix.ing · top · new · best · stats · spec

Paths of homomorphisms from stable Kneser graphs

2010/06/02 by Carsten Schultz, Schultz, Carsten
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Homotopy and Cohomology in Algebraic Topology #Topological and Geometric Data Analysis #math.CO

paper · pdf · doi:10.48550/arxiv.1006.0474

7 pages

arxiv created 2010/06/02 · openalex publication_date 2010/06/02 · arxiv updated 2010/06/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 n≥2 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 n≥2 the graph SGn,k is not a test graph.

Related