✦ LIBER ✦

On the number of tournaments with prescribed score vector

✍ Scribed by Wan Honghui; Li Qiao

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 322 KB
Volume: 61
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90092-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Binary vectors with prescribed subsets o

Binary vectors with prescribed subsets of consecutive ones

✍ Tom M Apostol 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 511 KB

On the number of Hamiltonian cycles in t

On the number of Hamiltonian cycles in tournaments

✍ Carsten Thomassen 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 949 KB

The main results assert that the minimum number of Hamiltonian bypasses in a strong tournament of order n and the minimum number of Hamiltonian cycles in a 2-connected tournament of order n increase exponentially with n. Furthermore, the number of Hamiltonian cycles in a tournament increases at leas

Hamiltonian tournaments with the least n

Hamiltonian tournaments with the least number of 3-cycles

✍ M. Burzio; D. C. Demaria 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 2 views

## Abstract We characterize the family of hamiltonian tournaments with the least number of 3‐cycles, studying their structure and their score sequence. Furthermore, we obtain the number of nonisomorphic tournaments of this family.

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

The Enumeration of Permutations with a P

The Enumeration of Permutations with a Prescribed Number of “Forbidden” Patterns

✍ John Noonan; Doron Zeilberger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 219 KB

We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of ''forbidden'' patterns that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns ''abc, '' ''cab,'' and ''