English

The automorphism group of the $s$-stable Kneser graphs

Combinatorics 2015-11-24 v2

Abstract

For k,s2k,s\geq2, the ss-stable Kneser graphs are the graphs with vertex set the kk-subsets SS of {1,,n}\{1,\ldots,n\} such that the circular distance between any two elements in SS is at least ss and two vertices are adjacent if and only if the corresponding kk-subset are disjoint. Braun showed that for n2k+1n\geq 2k+1 the automorphism group of the 22-stable Kneser graphs (Schrijver graphs) is isomorphic to the dihedral group of order 2n2n. In this paper we generalize this result by proving that for s2s\geq 2 and nsk+1n\geq sk+1 the automorphism group of the ss-stable Kneser graphs also is isomorphic to the dihedral group of order 2n2n.

Keywords

Cite

@article{arxiv.1509.09185,
  title  = {The automorphism group of the $s$-stable Kneser graphs},
  author = {Pablo Torres},
  journal= {arXiv preprint arXiv:1509.09185},
  year   = {2015}
}