arXiv · 2401.15198
$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-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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Agustina V. Ledezma, Adrián G. Pastine. 2024-01-26. $s$-Stable Kneser Graph are Hamiltonian. https://arxiv.org/abs/2401.15198
Cite the original work for its findings. Save a collection to share your selection of sources.