$s$-Stable Kneser Graph are Hamiltonian
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911766141730816 |
|---|---|
| author | Ledezma, Agustina V. Pastine, Adrián G. |
| author_facet | Ledezma, Agustina V. Pastine, Adrián G. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_15198 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | $s$-Stable Kneser Graph are Hamiltonian Ledezma, Agustina V. Pastine, Adrián G. Combinatorics 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. |
| title | $s$-Stable Kneser Graph are Hamiltonian |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2401.15198 |