加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本