Title of article
The number of kings in a multipartite tournament Original Research Article
Author/Authors
K.M. Koh، نويسنده , , B.P. Tan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
8
From page
411
To page
418
Abstract
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).
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951796
Link To Document