Article
Licensed
Unlicensed
Requires Authentication
Score lists in [h-k]-bipartite hypertournaments
-
S. Pirzada
Published/Copyright:
June 30, 2009
Abstract
Let m, n, h and k be integers such that m ≥ h > 1 and n ≥ k > 1. An [h-k]-bipartite hypertournament on m + n vertices is a triple (U, V, E), with two vertex sets U and V, |U| = m, |V| = n, together with an arc set E, a set of (h + k)-tuples of vertices, with exactly h vertices from U and exactly k vertices from V, called arcs, such that for any h-subset U1 of U and k-subset V1 of V, E contains exactly one of the (h + k)! (h + k)-tuples whose h entries belong to U1 and k entries belong to V1. We obtain necessary and sufficient conditions for a pair of nondecreasing sequences of nonnegative integers to be the losing score lists or score lists of some [h-k]-bipartite hypertournament.
Received: 2006-05-06
Published Online: 2009-06-30
Published in Print: 2009-July
© de Gruyter 2009
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric
- New methods of investigation of perfectly balanced Boolean functions
- On completeness and A-completeness of S-sets of determinate functions containing all one-place determinate S-functions
- On repetition-free Boolean functions over pre-elementary monotone bases
- Maximal groups of invariant transformations of multiaffine, bijunctive, weakly positive, and weakly negative Boolean functions
- Asymptotic normality of the number of absent noncontinuous chains of outcomes of independent trials
- On a class of statistics of polynomial samples
- Score lists in [h-k]-bipartite hypertournaments
- On one statistical model of steganography
Articles in the same Issue
- Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric
- New methods of investigation of perfectly balanced Boolean functions
- On completeness and A-completeness of S-sets of determinate functions containing all one-place determinate S-functions
- On repetition-free Boolean functions over pre-elementary monotone bases
- Maximal groups of invariant transformations of multiaffine, bijunctive, weakly positive, and weakly negative Boolean functions
- Asymptotic normality of the number of absent noncontinuous chains of outcomes of independent trials
- On a class of statistics of polynomial samples
- Score lists in [h-k]-bipartite hypertournaments
- On one statistical model of steganography
