AbstractWe obtain a criterion for determining whether or not a non-decreasing sequence of non-negative integers is a degree sequence of some k-hypertournament on n vertices. This result generalizes the corresponding theorems on tournaments proposed by Landau [H.G. Landau, On dominance relations and the structure of animal societies. III. The condition for a score structure, Bull. Math. Biophys. 15 (1953) 143–148] in 1953
AbstractIn this paper we give an algorithm for generating all tournament score sequences of a given ...
Given two integers n and k, n k ? 1, a k-hypertournament T on n vertices is a pair (V; A), where V ...
Let V be a n-set (set of size n). Let E be the collection of all possible k-subsets (subsets of size...
AbstractWe obtain a criterion for determining whether or not a non-decreasing sequence of non-negati...
AbstractGiven two nonnegative integers n and k withn≥k> 1, a k -hypertournament on n vertices is a p...
A $k$-hypertournament is a complete $k$-hypergraph with each $k$-edge endowed with an orientation, t...
A k-hypertournament H = (V, A), where V is the vertex set and A is an arc set, is a complete k-hyper...
AbstractA k-hypertournament is a complete k-hypergraph with all k-edges endowed with orientations. T...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
AbstractIn this paper we give an algorithm for generating all tournament score sequences of a given ...
Given two integers n and k, n k ? 1, a k-hypertournament T on n vertices is a pair (V; A), where V ...
Let V be a n-set (set of size n). Let E be the collection of all possible k-subsets (subsets of size...
AbstractWe obtain a criterion for determining whether or not a non-decreasing sequence of non-negati...
AbstractGiven two nonnegative integers n and k withn≥k> 1, a k -hypertournament on n vertices is a p...
A $k$-hypertournament is a complete $k$-hypergraph with each $k$-edge endowed with an orientation, t...
A k-hypertournament H = (V, A), where V is the vertex set and A is an arc set, is a complete k-hyper...
AbstractA k-hypertournament is a complete k-hypergraph with all k-edges endowed with orientations. T...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
Given two integers n and k, n k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V ...
AbstractIn this paper we give an algorithm for generating all tournament score sequences of a given ...
Given two integers n and k, n k ? 1, a k-hypertournament T on n vertices is a pair (V; A), where V ...
Let V be a n-set (set of size n). Let E be the collection of all possible k-subsets (subsets of size...
DOI
Add to ORKG