The equivariant topology of stable Kneser graphs

Schrijver introduced the stable Kneser graph $SG_{n,k}, n \geq 1, k \geq 0$. This graph is a vertex critical graph with chromatic number $k+2$, its vertices are certain subsets of a set of cardinality $m=2n+k$. Björner and de Longueville have shown that its box complex is homotopy equivalent to a sp...

Full description

Bibliographic Details
Main Author: Carsten Schultz
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2011-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/2960/pdf
_version_ 1797270367431032832
author Carsten Schultz
author_facet Carsten Schultz
author_sort Carsten Schultz
collection DOAJ
description Schrijver introduced the stable Kneser graph $SG_{n,k}, n \geq 1, k \geq 0$. This graph is a vertex critical graph with chromatic number $k+2$, its vertices are certain subsets of a set of cardinality $m=2n+k$. Björner and de Longueville have shown that its box complex is homotopy equivalent to a sphere, $\mathrm{Hom}(K_2,SG_{n,k}) \simeq \mathbb{S}^k$. The dihedral group $D_{2m}$ acts canonically on $SG_{n,k}$. We study the $D_{2m}$ action on $\mathrm{Hom}(K_2,SG_{n,k})$ and define a corresponding orthogonal action on $\mathbb{R}^{k+1} \supset \mathbb{S}^k$. We establish a close equivariant relationship between the graphs $SG_{n,k}$ and Borsuk graphs of the $k$-sphere and use this together with calculations in the $\mathbb{Z}_2$-cohomology ring of $D_{2m}$ to tell which stable Kneser graphs are test graphs in the sense of Babson and Kozlov. The graphs $SG_{2s,4}$ are test graphs, i.e. for every graph $H$ and $r \geq 0$ such that $\mathrm{Hom}(SG_{2s,4},H)$ is $(r-1)$-connected, the chromatic number $\chi (H)$ is at least $r+6$. On the other hand, if $k \notin \{0,1,2,4,8\}$ and $n \geq N(k)$ then $SG_{n,k}$ is not a homotopy test graph, i.e. there are a graph $G$ and an $r \geq 1$ such that $\mathrm{Hom}(SG_{n,k}, G)$ is $(r-1)$-connected and $\chi (G) < r+k+2$. The latter result also depends on a new necessary criterion for being a test graph, which involves the automorphism group of the graph.
first_indexed 2024-04-25T02:03:09Z
format Article
id doaj.art-9e22dc73d9134232b6d3bb64a553532e
institution Directory Open Access Journal
issn 1365-8050
language English
last_indexed 2024-04-25T02:03:09Z
publishDate 2011-01-01
publisher Discrete Mathematics & Theoretical Computer Science
record_format Article
series Discrete Mathematics & Theoretical Computer Science
spelling doaj.art-9e22dc73d9134232b6d3bb64a553532e2024-03-07T14:49:33ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502011-01-01DMTCS Proceedings vol. AO,...Proceedings10.46298/dmtcs.29602960The equivariant topology of stable Kneser graphsCarsten Schultz0Institut für MathematikSchrijver introduced the stable Kneser graph $SG_{n,k}, n \geq 1, k \geq 0$. This graph is a vertex critical graph with chromatic number $k+2$, its vertices are certain subsets of a set of cardinality $m=2n+k$. Björner and de Longueville have shown that its box complex is homotopy equivalent to a sphere, $\mathrm{Hom}(K_2,SG_{n,k}) \simeq \mathbb{S}^k$. The dihedral group $D_{2m}$ acts canonically on $SG_{n,k}$. We study the $D_{2m}$ action on $\mathrm{Hom}(K_2,SG_{n,k})$ and define a corresponding orthogonal action on $\mathbb{R}^{k+1} \supset \mathbb{S}^k$. We establish a close equivariant relationship between the graphs $SG_{n,k}$ and Borsuk graphs of the $k$-sphere and use this together with calculations in the $\mathbb{Z}_2$-cohomology ring of $D_{2m}$ to tell which stable Kneser graphs are test graphs in the sense of Babson and Kozlov. The graphs $SG_{2s,4}$ are test graphs, i.e. for every graph $H$ and $r \geq 0$ such that $\mathrm{Hom}(SG_{2s,4},H)$ is $(r-1)$-connected, the chromatic number $\chi (H)$ is at least $r+6$. On the other hand, if $k \notin \{0,1,2,4,8\}$ and $n \geq N(k)$ then $SG_{n,k}$ is not a homotopy test graph, i.e. there are a graph $G$ and an $r \geq 1$ such that $\mathrm{Hom}(SG_{n,k}, G)$ is $(r-1)$-connected and $\chi (G) < r+k+2$. The latter result also depends on a new necessary criterion for being a test graph, which involves the automorphism group of the graph.https://dmtcs.episciences.org/2960/pdfalternating oriented matroidtest graphstable kneser graphhom complexgraph homomorphism[math.math-co] mathematics [math]/combinatorics [math.co][info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
spellingShingle Carsten Schultz
The equivariant topology of stable Kneser graphs
Discrete Mathematics & Theoretical Computer Science
alternating oriented matroid
test graph
stable kneser graph
hom complex
graph homomorphism
[math.math-co] mathematics [math]/combinatorics [math.co]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
title The equivariant topology of stable Kneser graphs
title_full The equivariant topology of stable Kneser graphs
title_fullStr The equivariant topology of stable Kneser graphs
title_full_unstemmed The equivariant topology of stable Kneser graphs
title_short The equivariant topology of stable Kneser graphs
title_sort equivariant topology of stable kneser graphs
topic alternating oriented matroid
test graph
stable kneser graph
hom complex
graph homomorphism
[math.math-co] mathematics [math]/combinatorics [math.co]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
url https://dmtcs.episciences.org/2960/pdf
work_keys_str_mv AT carstenschultz theequivarianttopologyofstableknesergraphs
AT carstenschultz equivarianttopologyofstableknesergraphs