✦ LIBER ✦

The existence of court balanced tournament designs

✍ Scribed by E. Mendelsohn; P. Rodney

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 564 KB
Volume: 133
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90027-2

No coin nor oath required. For personal study only.

✦ Synopsis

Let V be a set of n elements. A tournament design, TD(n, c), is a c-row array of the ("2) pairs of elements from V such that every element appears at most once is each column. A court balanced tournament design, CBTD(n,c), has the added property that every element appears the same number of times in each row. We show that CBTD(n,c) exist for all n and c satisfying cl(;) and c( n -1 and discuss the application of CBTDs to scheduling round robin tournaments fairly with respect to a given number of courts.

📜 SIMILAR VOLUMES

On the existence of balanced bipartite d

On the existence of balanced bipartite designs, II

✍ Charlotte Huang 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 935 KB

An existence theory for pairwise balance

An existence theory for pairwise balanced designs, III: Proof of the existence conjectures

✍ Richard M Wilson 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 488 KB

Pitch tournament designs and other BIBDs

Pitch tournament designs and other BIBDs—existence results for the case ν = 8n

✍ R. Julian R. Abel; Norman J. Finizio; Malcolm Greig; Scott J. Lewis 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract A pitch tournament is a resolvable or near resolvable(ν,8,7) BIBD that satisfies certain criteria in addition to theusual condition that ν ≡ 0 or 1 (mod 8). Here we establish that for the case ν = 8__n__ the necessary condition forpitch tournaments is sufficient for all __n__ > 1615, wi

On the existence of specified cycles in

On the existence of specified cycles in a tournament

✍ Abdelhamid Benhocine; A. Pawel Wojda 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB 👁 1 views

For 2 s p s n and n 2 3, D(n, p) denotes the digraph with n vertices obtained from a directed cycle of length n by changing the orientation of p -1 consecutives edges. In this paper, we prove that every tournament of order n 2 7 contains D(n, p ) for p = 2, 3, ..., n. Furthermore, we determine the t

On the existence of triplewhist tourname

On the existence of triplewhist tournaments TWh(v)

✍ Y. Lu; L. Zhu 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 2 views

It is well known that a triplewhist tournament TWh(v) exists only if v ≡ 0 or 1 (mod 4) and v = 5, 9. In this article, we introduce a new concept TWh-frame and use it to show that the necessary condition for the existence of a TWh(v) is also sufficient with a handful possible exceptions of v ∈ {12,

The existence spectrum of golf designs

✍ Yanxun Chang 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract In this note, a golf design of order 41 is constructed. Combined Colbourn and Nonay's result, the existence spectrum of golf design of order υ is the set {υ: υ≡1 (mod 2), υ ≥ 3, υ ≠ 5}. © 2005 Wiley Periodicals, Inc. J Combin Designs 15: 84–89, 2007