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

A bound for the number of tournaments with specified scores

โœ Scribed by Peter M Gibson

Book ID
107884198
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
222 KB
Volume
36
Category
Article
ISSN
0095-8956

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 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 tournaments with a unique
The number of tournaments with a unique spanning cycle
โœ J. W. Moon ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 312 KB ๐Ÿ‘ 1 views

## Abstract The number of tournaments __T~n~__ on __n__ nodes with a unique spanning cycle is the (2__n__โ€6)th Fibonacci number when __n__ โ‰ฅ 4. Another proof of this result is given based on a recursive construction of these tournaments.

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