Given two nonnegative integers n and k with n ≥ k > 1, a k-hypertournament on n vertices is a pair (V, A), where V is a set of vertices with |V | = n and A is a set of k-tuples of vertices, called arcs, such that for any k-subset S of V , A contains exactly one of the k! k-tuples whose entries belong to S. We show that a nondecreasing sequence (r1, r2… (More)

Laudau, On dominance relation and the structure of animal societies, III: The condition for a score structure

G. H

Bull. Math. Biophys.,

1953

1 Excerpt

Similar Papers

Loading similar papers…

Cite this paper

@article{Zhou2000OnSS,
title={On Score Sequences ofk-Hypertournaments},
author={Guofei Zhou and Tianxing Yao and Kemin Zhang},
journal={Eur. J. Comb.},
year={2000},
volume={21},
pages={993-1000}
}