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).
Toppling kings in a tournament by introducing new kings
β Scribed by Huang Jing; Li Weixuan
- Publisher
- John Wiley and Sons
- Year
- 1987
- Tongue
- English
- Weight
- 193 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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.
The spectacular success in materials science of the application of combinatorial chemistry has raised the hope that it may eventually lead to a new scientific approach to catalyst development. This method is, within the constraints of heterogeneous catalysis, merely a potentially efficient tool to b