s$-Stable Kneser Graph are Hamiltonian

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 a...

Full description

Saved in:
Bibliographic Details
Published inThe Electronic journal of combinatorics Vol. 32; no. 3
Main Authors Ledezma, Agustina V., Pastine, Adrián
Format Journal Article
LanguageEnglish
Published 22.08.2025
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1077-8926
1077-8926
DOI:10.37236/12739