The automorphism group of the $s$-stable Kneser graphs
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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.