AbstractWe 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)
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
AbstractAnn-partite tournament is an orientation of a completen-partite graph. In 1976, Bondy raised...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
AbstractKoh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-ki...
AbstractWe show that in any n-partite tournament, where n ⩾ 3, with no transmitters and no 3-kings, ...
AbstractLet T be an n-partite tournament and let kr(T) denote the number of r-kings of T. Gutin (198...
AbstractKoh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submi...
AbstractWe present all possible distributions of 3-kings in 3-partite tournaments with at most one t...
AbstractLet t=(t1,t2,…,tn) and c=(c1,c2,…,cn) be two n-tuples of nonnegative integers. An all-4-king...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutua...
Gutin and Rafiey [Multipartite tournaments with small number of cycles, Australas J. Combin. 34 (200...
If T is an n-vertex tournament with a given number of 3-cycles, what can be said about the number of...
Volkmann, Discrete Math. 45 (2002) 19-53, posed the following question. Let 4 be less than or equal...
AbstractWe present a variety of results concerning characterization, number, distribution and some a...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
AbstractAnn-partite tournament is an orientation of a completen-partite graph. In 1976, Bondy raised...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
AbstractKoh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-ki...
AbstractWe show that in any n-partite tournament, where n ⩾ 3, with no transmitters and no 3-kings, ...
AbstractLet T be an n-partite tournament and let kr(T) denote the number of r-kings of T. Gutin (198...
AbstractKoh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submi...
AbstractWe present all possible distributions of 3-kings in 3-partite tournaments with at most one t...
AbstractLet t=(t1,t2,…,tn) and c=(c1,c2,…,cn) be two n-tuples of nonnegative integers. An all-4-king...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutua...
Gutin and Rafiey [Multipartite tournaments with small number of cycles, Australas J. Combin. 34 (200...
If T is an n-vertex tournament with a given number of 3-cycles, what can be said about the number of...
Volkmann, Discrete Math. 45 (2002) 19-53, posed the following question. Let 4 be less than or equal...
AbstractWe present a variety of results concerning characterization, number, distribution and some a...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
AbstractAnn-partite tournament is an orientation of a completen-partite graph. In 1976, Bondy raised...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
DOI
Add to ORKG