A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917588010795008 |
|---|---|
| author | Zhang, Jie Wang, Zhilan Yan, Jin |
| author_facet | Zhang, Jie Wang, Zhilan Yan, Jin |
| contents | Let c be an integer. A c-partite tournament is an orientation of a complete c-partite graph. A c-partite tournament is rich if it is strong, and each partite set has at least two vertices. In 1996, Guo and Volkmann characterized the structure of all rich c-partite tournaments without (c + 1)-cycles, which solved a problem by Bondy. They also put forward a problem that what the structure of rich c-partite tournaments without (c + k)-cycles for some k>1 is. In this paper, we answer the question of Guo and Volkmann for k = 2. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_10823 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles Zhang, Jie Wang, Zhilan Yan, Jin Combinatorics Let c be an integer. A c-partite tournament is an orientation of a complete c-partite graph. A c-partite tournament is rich if it is strong, and each partite set has at least two vertices. In 1996, Guo and Volkmann characterized the structure of all rich c-partite tournaments without (c + 1)-cycles, which solved a problem by Bondy. They also put forward a problem that what the structure of rich c-partite tournaments without (c + k)-cycles for some k>1 is. In this paper, we answer the question of Guo and Volkmann for k = 2. |
| title | A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2206.10823 |