$s$-Stable Kneser Graph are Hamiltonian
Combinatorics
2024-01-30 v1
Abstract
The Kneser Graph has as vertices all -subsets of and edges connecting two vertices if they are disjoint. The -stable Kneser Graph is obtained from the Kneser graph by deleting vertices with elements at cyclic distance less than . In this article we show that connected -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}
}