s-Stable Kneser Graph are Hamiltonian
Abstract
The Kneser Graph K(n,k) has as vertices all k-subsets of \1,…,n\ and edges connecting two vertices if they are disjoint. The s-stable Kneser Graph Ks-stab(n, k) is obtained from the Kneser graph by deleting vertices with elements at cyclic distance less than s. In this article we show that connected s-Stable Kneser graph are Hamiltonian.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.