✦ LIBER ✦

The number of kings in a multipartite tournament

✍ Scribed by K.M. Koh; B.P. Tan

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 401 KB
Volume: 167-168
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00244-0

No coin nor oath required. For personal study only.

✦ Synopsis

We show that in any n-partite tournament, where n/> 3, with no transmitters and no 3-kings, the number of 4-kings is at least eight. All n-partite tournaments, where n/>3, having eight 4-kings and no 3-kings are completely characterized. This solves the problem proposed in Koh and Tan (accepted).

📜 SIMILAR VOLUMES

Kings in multipartite tournaments

✍ K.M. Koh; B.P. Tan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 584 KB

Let T be an n-partite tournament and let k,(T) denote the number of r-kings of T. Gutin (1986) and Petrovic and Thomassen (1991) proved independently that if T contains at most one transmitter, then k4(T) >i 1, and found infinitely many bipartite tournaments T with at most one transmitter such that

Number of 4-kings in bipartite tournamen

Number of 4-kings in bipartite tournaments with no 3-kings

✍ K.M. Koh; B.P. Tan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 433 KB

We show that in any bipartite tournament with no transmitters and no 3-kings, the number of 4-kings is at least eight. All such bipartite tournaments having exactly eight 4-kings are completely characterized.

The cycle structure of regular multipart

The cycle structure of regular multipartite tournaments

✍ Yubao Guo; Jin Ho Kwak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 67 KB

Toppling kings in a tournament by introd

Toppling kings in a tournament by introducing new kings

✍ Huang Jing; Li Weixuan 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB

Sorting a sequence of strong kings in a

Sorting a sequence of strong kings in a tournament

✍ Ting-Yem Ho; Jou-Ming Chang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 79 KB

A king in a tournament is a player who beats any other player directly or indirectly. According to the existence of a king in every tournament, Wu and Sheng [Inform. Process. Lett. 79 (2001) 297-299] recently presented an algorithm for finding a sorted sequence of kings in a tournament of size n, i.

Cycles through arcs in multipartite tour

Cycles through arcs in multipartite tournaments and a conjecture of Volkmann

✍ Hongwei Li; Shengjia Li; Yubao Guo; Qiaoping Guo 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Volkmann [L. Volkmann, A remark on cycles through an arc in strongly connected multipartite tournaments, Appl. Math. Lett. 20 (2007Lett. 20 ( ) 1148Lett. 20 ( -1150] ] conjectured that a strong c-partite tournament with c ≥ 3 contains three arcs that belong to a cycle of length m for each m ∈ {3, 4,