𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotic Enumeration of Tournaments with a Given Score Sequence

✍ Scribed by Brendan D. McKay; Xiaoji Wang

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
560 KB
Volume
73
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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

The number of bipartite tournaments with
The number of bipartite tournaments with a unique given factor
✍ Manoussakis Manolis; Manoussakis Yannis 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 571 KB

We give a recursive function in order to calculate the number of all nonisomorphic bipartite tournaments containing an unique hamiltonian cycle. Using this result we determine the number of all nonisomorphic bipartite tournaments that admit an unique factor isomorphic to a given l-diregular bipartit

The open shop scheduling problem with a
The open shop scheduling problem with a given sequence of jobs on one machine
✍ Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a

Advanced morphological 3D magnetic reson
Advanced morphological 3D magnetic resonance observation of cartilage repair tissue (MOCART) scoring using a new isotropic 3D proton-density, turbo spin echo sequence with variable flip angle distribution (PD-SPACE) compared to an isotropic 3D steady-state free precession sequence (True-FISP) and standard 2D sequences
✍ Goetz H. Welsch; Lukas Zak; Tallal C. Mamisch; Dominik Paul; Lars Lauer; Andreas 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

## Abstract ## Purpose To evaluate a new isotropic 3D proton‐density, turbo‐spin‐echo sequence with variable flip‐angle distribution (PD‐SPACE) sequence compared to an isotropic 3D true‐fast‐imaging with steady‐state‐precession (True‐FISP) sequence and 2D standard MR sequences with regard to the n