✦ LIBER ✦

Minimal pairwise balanced designs

✍ Scribed by R.G. Stanton

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 276 KB
Volume: 77
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90370-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal clique partitions and pairwise b

Minimal clique partitions and pairwise balanced designs

✍ Rolf Rees 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 666 KB

We consider the problem of determining cp(G v KC), the smallest number of cliques required to partition the edge set of the graph G v K~, where G is a finite simple graph and K~, is the empty graph on m vertices. A lower bound on cp(G v K~,,,) is obtained which, when applied to the case G = K,, shar

Percentages in pairwise balanced designs

✍ Charles J. Colbourn; Vojtech Rődl 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Let K = {k,, , k,} be a set of block sizes, and let (pr, , p,} be nonnegative numbers with Cy!',,p, = 1. We prove the following theorem: for any E >O, if a (u, K, 1) pairwise balanced design exists and v is sufficiently large, then a (u, K, 1) pairwise balanced design exists in which the fraction

On the structure of regular pairwise bal

On the structure of regular pairwise balanced designs

✍ David McCarthy; S.A. Vanstone 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 664 KB

Multiprocessor interconnection network u

Multiprocessor interconnection network using pairwise balanced combinatorial designs

✍ Simon Y. Berkovich 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 470 KB

Embeddability and construction of affine

Embeddability and construction of affine α-resolvable pairwise balanced designs

✍ Boris Bekker; Yury J. Ionin; Mohan S. Shrikhande 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB 👁 1 views

An affine α-resolvable PBD of index λ is a triple (V, B, R), where V is a set (of points), B is a collection of subsets of V (blocks), and R is a partition of B (resolution), satisfying the following conditions: (i) any two points occur together in λ blocks, (ii) any point occurs in α blocks of each

Cycles in the block-intersection graph o

Cycles in the block-intersection graph of pairwise balanced designs

✍ Donovan R. Hare 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 580 KB

It is shown that the block-intersection graph of a pairwise balance design with ),= l is edge-pancyclic given that its minimum block cardinality is at least 3.