$s$-Stable Kneser Graph are Hamiltonian
Abstract
The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-\text{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 graphs are Hamiltonian.
Published
2025-08-22
How to Cite
Ledezma, A. V., & Pastine, A. (2025). $s$-Stable Kneser Graph are Hamiltonian. The Electronic Journal of Combinatorics, 32(3), P3.33. https://doi.org/10.37236/12739
Article Number
P3.33