✦ LIBER ✦

Score sequences: Lexicographic enumeration and tournament construction

✍ Scribed by S.V. Gervacio

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 289 KB
Volume: 72
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90203-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asymptotic Enumeration of Tournaments wi

Asymptotic Enumeration of Tournaments with a Given Score Sequence

✍ Brendan D. McKay; Xiaoji Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 560 KB

We obtain the asymptotic number of labeled trounaments with a given score sequence in the case where each score is nÂ2+O(n 3Â4+= ) for sufficiently small =>0. Some consequences for the score sequences of random tournaments are also noted. The method used is integration in n complex dimensions.

Asymptotic enumeration of tournaments wi

Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph

✍ Zhicheng Gao; Brendan D. McKay; Xiaoji Wang 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

This paper studies the probability that a random tournament with specified score sequence contains a specified subgraph. The exact asymptotic value is found in the case that the scores are not too far from regular and the subgraph is not too large. An ndimensional saddle-point method is used. As a s

Transitive partitions in realizations of

Transitive partitions in realizations of tournament score sequences

✍ Arthur H. Busch; Guantao Chen; Michael S. Jacobson 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## Abstract A tournament is an oriented complete graph, and one containing no directed cycles is called __transitive__. A tournament __T__=(__V, A__) is called __m__‐__partition transitive__ if there is a partition such that the subtournaments induced by each __X__~__i__~ are all transitive, an