{"paper":{"title":"The automorphism group of the $s$-stable Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pablo Torres","submitted_at":"2015-09-30T14:18:34Z","abstract_excerpt":"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 isomor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09185","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}