DOIAbstract
AbstractWe present all possible distributions of 3-kings in 3-partite tournaments with at most one transmitter
AbstractWe present all possible distributions of 3-kings in 3-partite tournaments with at most one transmitter
In two player competitions, the Bradley-Terry model is a well known probability model. There are sev...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
AbstractLet t=(t1,t2,…,tn) and c=(c1,c2,…,cn) be two n-tuples of nonnegative integers. An all-4-king...
AbstractKoh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-ki...
AbstractWe present all possible distributions of 3-kings in 3-partite tournaments with at most one t...
AbstractLet T be an n-partite tournament and let kr(T) denote the number of r-kings of T. Gutin (198...
AbstractWe show that in any n-partite tournament, where n ⩾ 3, with no transmitters and no 3-kings, ...
AbstractKoh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submi...
AbstractWe present a variety of results concerning characterization, number, distribution and some a...
Let T be a 3-partite tournament. We say that a vertex u is (C-3) over right arrow -free if v does no...
AbstractLet T be a 3-partite tournament. We say that a vertex v is C3⃗-free if v does not lie on any...
If T is an n-vertex tournament with a given number of 3-cycles, what can be said about the number of...
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutua...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
Conway's theory of partizan games is both a theory of games and a theory of num-bers. We presen...
In two player competitions, the Bradley-Terry model is a well known probability model. There are sev...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
AbstractLet t=(t1,t2,…,tn) and c=(c1,c2,…,cn) be two n-tuples of nonnegative integers. An all-4-king...
AbstractKoh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-ki...
AbstractWe present all possible distributions of 3-kings in 3-partite tournaments with at most one t...
AbstractLet T be an n-partite tournament and let kr(T) denote the number of r-kings of T. Gutin (198...
AbstractWe show that in any n-partite tournament, where n ⩾ 3, with no transmitters and no 3-kings, ...
AbstractKoh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submi...
AbstractWe present a variety of results concerning characterization, number, distribution and some a...
Let T be a 3-partite tournament. We say that a vertex u is (C-3) over right arrow -free if v does no...
AbstractLet T be a 3-partite tournament. We say that a vertex v is C3⃗-free if v does not lie on any...
If T is an n-vertex tournament with a given number of 3-cycles, what can be said about the number of...
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutua...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
Conway's theory of partizan games is both a theory of games and a theory of num-bers. We presen...
In two player competitions, the Bradley-Terry model is a well known probability model. There are sev...
[[abstract]]A king x in a tournament T is a player who beats any other player y directly (i.e., x ->...
AbstractLet t=(t1,t2,…,tn) and c=(c1,c2,…,cn) be two n-tuples of nonnegative integers. An all-4-king...
Add to ORKG