A note on reducible cycles in multipartite tournaments (Q698553)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1803272
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on reducible cycles in multipartite tournaments |
scientific article; zbMATH DE number 1803272 |
Statements
A note on reducible cycles in multipartite tournaments (English)
0 references
26 March 2003
0 references
The main lemma (Lemma 4) of this note is an easy consequence of the following more general result by Guo and Volkmann [cf. \textit{Y. Guo}, Semicomplete multipartite digraphs: A generalization of tournaments (Habilitation Thesis, RWTH Aachen) (1998)]. Let \(D\) be a strongly connected \(c\)-partite tournament. Then every partite set of \(D\) has at least one vertex which lies on a cycle \(C_m\) of length \(m\) for each \(m\in\{3,4,\ldots,c\}\) such that \(V(C_3)\subset V(C_4)\subset\cdots \subset V(C_c)\). Also Corollary 9 of this note is well known (cf. Corollary 6.2 of the Habilitation Thesis by Y. Guo). Revievers remark: In 1998, Y. Guo has sent his Habilitation Thesis to the third author Ke-Min Zhang.
0 references
multipartite tournaments
0 references
cycles
0 references
0.8271077275276184
0 references
0.8158125877380371
0 references
0.8116909861564636
0 references
0.8019313216209412
0 references
0.8013107180595398
0 references
