Publication date
January 1986
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractWe prove that each set of four or five nonnegative integers is a score set of a tournament
AbstractWe prove that each set of four or five nonnegative integers is a score set of a tournament
AbstractLet t=(t1,t2,…,tn) and c=(c1,c2,…,cn) be two n-tuples of nonnegative integers. An all-4-king...
A tournament T of order n is a digraph V(T), A(T) with vertex-set V(T)=&1,2,...,n such that for ever...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
AbstractWe prove that each set of four or five nonnegative integers is a score set of a tournament
The score set of a tournament is defined as the set of its different outdegrees. In 1978 Reid [15] p...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
This thesis involves the study of a two person game played on a tournament and some results concerni...
Reid conjectured that any finite set of non-negative integers is the score set of some tournament an...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
AbstractGiven two nonnegative integers n and k withn≥k> 1, a k -hypertournament on n vertices is a p...
AbstractIn this paper we give an algorithm for generating all tournament score sequences of a given ...
Contrary to popular belief, we can’t all be winners. Suppose 6 people compete in a chess tournament ...
Contrary to popular belief, we can’t all be winners. Suppose 6 people compete in a chess tournament ...
AbstractAn n-tournament is a complete labelled digraph on n vertices without loops or multiple arcs....
The problem of a multiple player dice tournament is discussed and solved in the paper. A die has a ...
AbstractLet t=(t1,t2,…,tn) and c=(c1,c2,…,cn) be two n-tuples of nonnegative integers. An all-4-king...
A tournament T of order n is a digraph V(T), A(T) with vertex-set V(T)=&1,2,...,n such that for ever...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
AbstractWe prove that each set of four or five nonnegative integers is a score set of a tournament
The score set of a tournament is defined as the set of its different outdegrees. In 1978 Reid [15] p...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
This thesis involves the study of a two person game played on a tournament and some results concerni...
Reid conjectured that any finite set of non-negative integers is the score set of some tournament an...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
AbstractGiven two nonnegative integers n and k withn≥k> 1, a k -hypertournament on n vertices is a p...
AbstractIn this paper we give an algorithm for generating all tournament score sequences of a given ...
Contrary to popular belief, we can’t all be winners. Suppose 6 people compete in a chess tournament ...
Contrary to popular belief, we can’t all be winners. Suppose 6 people compete in a chess tournament ...
AbstractAn n-tournament is a complete labelled digraph on n vertices without loops or multiple arcs....
The problem of a multiple player dice tournament is discussed and solved in the paper. A die has a ...
AbstractLet t=(t1,t2,…,tn) and c=(c1,c2,…,cn) be two n-tuples of nonnegative integers. An all-4-king...
A tournament T of order n is a digraph V(T), A(T) with vertex-set V(T)=&1,2,...,n such that for ever...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
Add to ORKG