AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T and (b) if x ≠ y then (x, y) ∈ T iff (y, x) ∉ T. The score vector of T is the cardinal valued function defined by R(x) = |{y ∈ X : (x, y) ∈ T}|. We present theorems for infinite tournaments analogous to Landau's necessary and sufficient conditions that a vector be the score vector for some finite tournament. Included also is a new proof of Landau's theorem based on a simple application of the “marriage” theorem
AbstractThe paper deals with tournaments (i.e., with trichotomic relations) and their homomorphisms....
A tournament is any complete asymmetric relation over a finite set A of outcomes describing pairwise...
A tournament matrix is a square 0-1 matrix which satisfies: A+A^T = J-I, where J is the all one\u27s...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
This thesis involves the study of a two person game played on a tournament and some results concerni...
A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is ...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractWe prove that each set of four or five nonnegative integers is a score set of a tournament
AbstractLet T(S) be the set of tournament matrices with nonincreasing column sum vector S = (s1,…,sn...
This thesis focuses on two ideas in tournament theory: cycle intersections\ud in tournaments (i.e., ...
AbstractAn n-tournament Tn is said to be a Kotzig tournament if the n subtournaments of Tn of order ...
This is a treatise of the article by P. Avery on the condition for a tournament score sequence to be...
The score set of a tournament is defined as the set of its different outdegrees. In 1978 Reid [15] p...
AbstractAn n-tournament is a complete labelled digraph on n vertices without loops or multiple arcs....
AbstractWe obtain a criterion for determining whether or not a non-decreasing sequence of non-negati...
AbstractThe paper deals with tournaments (i.e., with trichotomic relations) and their homomorphisms....
A tournament is any complete asymmetric relation over a finite set A of outcomes describing pairwise...
A tournament matrix is a square 0-1 matrix which satisfies: A+A^T = J-I, where J is the all one\u27s...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
This thesis involves the study of a two person game played on a tournament and some results concerni...
A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is ...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractWe prove that each set of four or five nonnegative integers is a score set of a tournament
AbstractLet T(S) be the set of tournament matrices with nonincreasing column sum vector S = (s1,…,sn...
This thesis focuses on two ideas in tournament theory: cycle intersections\ud in tournaments (i.e., ...
AbstractAn n-tournament Tn is said to be a Kotzig tournament if the n subtournaments of Tn of order ...
This is a treatise of the article by P. Avery on the condition for a tournament score sequence to be...
The score set of a tournament is defined as the set of its different outdegrees. In 1978 Reid [15] p...
AbstractAn n-tournament is a complete labelled digraph on n vertices without loops or multiple arcs....
AbstractWe obtain a criterion for determining whether or not a non-decreasing sequence of non-negati...
AbstractThe paper deals with tournaments (i.e., with trichotomic relations) and their homomorphisms....
A tournament is any complete asymmetric relation over a finite set A of outcomes describing pairwise...
A tournament matrix is a square 0-1 matrix which satisfies: A+A^T = J-I, where J is the all one\u27s...