Reinterpreting the Middle-Levels Theorem via Natural Enumeration of Ordered Trees
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2019
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911982959984640 |
|---|---|
| author | Dejter, Italo J. |
| author_facet | Dejter, Italo J. |
| contents | Let $0<k\in\mathbb{Z}$. A reinterpretation of the proof of existence of Hamilton cycles in the middle-levels graph $M_k$ induced by the vertices of the $(2k+1)$-cube representing the $k$- and $(k+1)$-subsets of $\{0,\ldots,2k\}$ is given via an associated dihedral quotient graph of $M_k$ whose vertices represent the ordered (rooted) trees of order $k+1$ and size $k$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1911_02100 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Reinterpreting the Middle-Levels Theorem via Natural Enumeration of Ordered Trees Dejter, Italo J. Combinatorics 05C15, 05C62, 05C70, 06A05, 05C45 Let $0<k\in\mathbb{Z}$. A reinterpretation of the proof of existence of Hamilton cycles in the middle-levels graph $M_k$ induced by the vertices of the $(2k+1)$-cube representing the $k$- and $(k+1)$-subsets of $\{0,\ldots,2k\}$ is given via an associated dihedral quotient graph of $M_k$ whose vertices represent the ordered (rooted) trees of order $k+1$ and size $k$. |
| title | Reinterpreting the Middle-Levels Theorem via Natural Enumeration of Ordered Trees |
| topic | Combinatorics 05C15, 05C62, 05C70, 06A05, 05C45 |
| url | https://arxiv.org/abs/1911.02100 |