๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On score sets for tournaments

โœ Scribed by Michael Hager

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
461 KB
Volume
58
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Score certificates for tournaments
Score certificates for tournaments
โœ Kim, Jeong Han; Tetali, Prasad; Fishburn, Peter ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 170 KB

The score of a vertex in a tournament is its out-degree. A score certificate for a labeled tournament T is a labeled subdigraph D of T which together with the score sequence of T allows errorless reconstruction of T. In this paper we prove a general lower bound on the sizes of score certificates. Ou

Landau's inequalities for tournament sco
Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
โœ Richard A. Brualdi; Jian Shen ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 106 KB

Ao and Hanson, and Guiduli, Gya ร‚ rfa ร‚ s, Thomasse ร‚ and Weidl independently, proved the following result: For any tournament score sequence S (s 1 , s 2 ,F F F,s n ) with s 1 s 2 ร ร ร s n , there exists a tournament T on vertex set f1Y 2Y F F F Y ng such that the score of each vertex i is s i an

Condition for a tournament score sequenc
Condition for a tournament score sequence to be simple
โœ Peter Avery ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 293 KB

## Abstract The condition is given for a (tournament) score sequence to belong to exactly one tournament.