𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Percentages in pairwise balanced designs

✍ Scribed by Charles J. Colbourn; Vojtech Rődl


Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
385 KB
Volume
77
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


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 of pairs appearing in blocks of size ki is pi f E for every i. We also show that the necessary conditions for a pairwise balanced design having precisely the fraction pi of its pairs in blocks of size ki for each i are asymptotically sufficient.


📜 SIMILAR VOLUMES


Minimal clique partitions and pairwise b
✍ 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

Cycles in the block-intersection graph o
✍ 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.

Embeddability and construction of affine
✍ 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