𝔖 Bobbio Scriptorium
✦   LIBER   ✦

IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES

✍ Scribed by Moon, J. W.

Book ID
118174578
Publisher
Taylor and Francis Group
Year
1993
Tongue
English
Weight
315 KB
Volume
16
Category
Article
ISSN
1607-3606

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

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

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.

Constructing fair round robin tournament
Constructing fair round robin tournaments with a minimum number of breaks
✍ Pim van ’t Hof; Gerhard Post; Dirk Briskorn πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 228 KB

Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the number of breaks is 2n -2, teams of the same club never play at home simultaneously, and they play against each other in

The 3 and 4-dichromatic tournaments of m
The 3 and 4-dichromatic tournaments of minimum order
✍ V. Neumann-Lara πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 630 KB

The dichromatic number k(D) of a digraph D is the minimum number of acyclic sets in which V(D) can be partitioned. If de(D) = Y, D is said r-dichromatic. In this paper it is proved that the minimum order of a 3-dichromatic (resp. 4-dichromatic) tournament is 7 (resp. 11). It is also proved that ther