✦ LIBER ✦

Kings in k-partite tournaments

✍ Scribed by Vojislav Petrovic; Carsten Thomassen

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 124 KB
Volume: 98
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90380-k

No coin nor oath required. For personal study only.

✦ Synopsis

Petrovic, V. and C. Thomassen, Kings in k-partite tournaments, Discrete Mathematics 98 (1991) 237-238.

We prove that every k-partite tournament with at most one vertex of in-degree zero contains a vertex from which each other vertex can be reached in at most four steps.

📜 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

Kings in bipartite tournaments

✍ Vojislav Petrovic 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 499 KB

We present a variety of results concerning characterization, number, distribution and some aspects of stability of r-kings (r = 2 4) of bipartite tournaments.

The radii of n-partite tournaments

✍ G. M. Gutin 📂 Article 📅 1986 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 151 KB

Diregularc-partite tournaments are verte

Diregularc-partite tournaments are vertex-pancyclic whenc ? 5

✍ Yeo, Anders 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB

## In [Volkmann, to appear] it is conjectured that all diregular c-partite tournaments, with c ≥ 4, are pancyclic. In this article, we show that all diregular c-partite tournaments, with c ≥ 5, are in fact vertex-pancyclic.

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.

2-Partition-Transitive Tournaments

✍ Barry Guiduli; András Gyárfás; Stéphan Thomassé; Peter Weidl 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 326 KB

Given a tournament score sequence s 1 s 2 } } } s n , we prove that there exists a tournament T on vertex set [1, 2, ..., n] such that the degree of any vertex i is s i and the subtournaments of T on both the even and the odd vertices are transitive in the given order. This means that i beats j when