Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 30 Sep 2015 in math.CO | (1509.09185v2)

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

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.