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
This is a treatise of the article by P. Avery on the condition for a tournament score sequence to be...
Abstract. The aim of this paper is to prove that there is no finite basis for the equations satisfie...
Contrary to popular belief, we can’t all be winners. Suppose 6 people compete in a chess tournament ...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
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
This thesis involves the study of a two person game played on a tournament and some results concerni...
AbstractWe call a tournamentunique, if there is no other tournament (barring isomorphic ones) which ...
AbstractIn this paper we give an algorithm for generating all tournament score sequences of a given ...
AbstractWe prove that each set of four or five nonnegative integers is a score set of a tournament
This thesis focuses on two ideas in tournament theory: cycle intersections\ud in tournaments (i.e., ...
AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that ar...
A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is ...
The score set of a tournament is defined as the set of its different outdegrees. In 1978 Reid [15] p...
AbstractH. G. Landau obtained necessary and sufficient conditions that non-negative integers r1, r2,...
This is a treatise of the article by P. Avery on the condition for a tournament score sequence to be...
Abstract. The aim of this paper is to prove that there is no finite basis for the equations satisfie...
Contrary to popular belief, we can’t all be winners. Suppose 6 people compete in a chess tournament ...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
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
This thesis involves the study of a two person game played on a tournament and some results concerni...
AbstractWe call a tournamentunique, if there is no other tournament (barring isomorphic ones) which ...
AbstractIn this paper we give an algorithm for generating all tournament score sequences of a given ...
AbstractWe prove that each set of four or five nonnegative integers is a score set of a tournament
This thesis focuses on two ideas in tournament theory: cycle intersections\ud in tournaments (i.e., ...
AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that ar...
A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is ...
The score set of a tournament is defined as the set of its different outdegrees. In 1978 Reid [15] p...
AbstractH. G. Landau obtained necessary and sufficient conditions that non-negative integers r1, r2,...
This is a treatise of the article by P. Avery on the condition for a tournament score sequence to be...
Abstract. The aim of this paper is to prove that there is no finite basis for the equations satisfie...
Contrary to popular belief, we can’t all be winners. Suppose 6 people compete in a chess tournament ...