A note on reducible cycles in multipartite tournaments

DOI10.11650/TWJM/1500407431MaRDI QIDQ698553zbMATH OpenOpenAlexFDO

Authors Linqiang Pan, Zhengke Miao, Keming Zhang

Publication date 26 March 2003

Published in Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL http://www.math.nthu.edu.tw/~tjm/abstract/0206/tjm0206_6.html

zbMATH Keywords

cyclesmultipartite tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Review text

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.

Recommendations

• A remark on cycles through an arc in strongly connected multipartite tournaments
• On cycles in multipartite tournaments
• On cycles through a given vertex in multipartite tournaments
• Extendable cycles in multipartite tournaments
• Cycles in multipartite tournaments

Cited in

(2)

• Multipartite tournaments: a survey
• A note on symmetry reduction for circular traveling tournament problems

This page was built for publication: A note on reducible cycles in multipartite tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698553)