English

$s$-Stable Kneser Graph are Hamiltonian

Combinatorics 2024-01-30 v1

Abstract

The Kneser Graph K(n,k)K(n,k) has as vertices all kk-subsets of {1,,n}\{1,\ldots,n\} and edges connecting two vertices if they are disjoint. The ss-stable Kneser Graph Ksstab(n,k)K_{s-stab}(n, k) is obtained from the Kneser graph by deleting vertices with elements at cyclic distance less than ss. In this article we show that connected ss-Stable Kneser graph are Hamiltonian.

Keywords

Cite

@article{arxiv.2401.15198,
  title  = {$s$-Stable Kneser Graph are Hamiltonian},
  author = {Agustina V. Ledezma and Adrián G. Pastine},
  journal= {arXiv preprint arXiv:2401.15198},
  year   = {2024}
}
R2 v1 2026-06-28T14:28:40.554Z