A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles
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,...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2023-12-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/9732/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849344668957933568 |
|---|---|
| author | Jie Zhang Zhilan Wang Jin Yan |
| author_facet | Jie Zhang Zhilan Wang Jin Yan |
| author_sort | Jie Zhang |
| collection | DOAJ |
| description | 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 | Article |
| id | doaj-art-a145eeaf7ffc46c2aa082a4b6c436614 |
| institution | Kabale University |
| issn | 1365-8050 |
| language | English |
| publishDate | 2023-12-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj-art-a145eeaf7ffc46c2aa082a4b6c4366142025-08-20T03:42:37ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502023-12-01vol. 25:2Graph Theory10.46298/dmtcs.97329732A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cyclesJie ZhangZhilan WangJin YanLet 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.http://dmtcs.episciences.org/9732/pdfmathematics - combinatorics |
| spellingShingle | Jie Zhang Zhilan Wang Jin Yan A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles Discrete Mathematics & Theoretical Computer Science mathematics - combinatorics |
| title | A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles |
| title_full | A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles |
| title_fullStr | A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles |
| title_full_unstemmed | A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles |
| title_short | A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles |
| title_sort | characterization of rich c partite c 7 tournaments without c 2 cycles |
| topic | mathematics - combinatorics |
| url | http://dmtcs.episciences.org/9732/pdf |
| work_keys_str_mv | AT jiezhang acharacterizationofrichcpartitec7tournamentswithoutc2cycles AT zhilanwang acharacterizationofrichcpartitec7tournamentswithoutc2cycles AT jinyan acharacterizationofrichcpartitec7tournamentswithoutc2cycles AT jiezhang characterizationofrichcpartitec7tournamentswithoutc2cycles AT zhilanwang characterizationofrichcpartitec7tournamentswithoutc2cycles AT jinyan characterizationofrichcpartitec7tournamentswithoutc2cycles |