✦ LIBER ✦

Minimal clique partitions and pairwise balanced designs

✍ Scribed by Rolf Rees

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

No coin nor oath required. For personal study only.

✦ Synopsis

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,, sharpens that of D. Stinson in some instances, and yields exact values for two new families of the parameters u and m. * This work forms a part of the author's doctoral dissertation.

📜 SIMILAR VOLUMES

Minimal pairwise balanced designs

✍ R.G. Stanton 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 276 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

On the number of distinct minimal clique

On the number of distinct minimal clique partitions and clique covers of a line graph

✍ Sean McGuinness; Rolf Rees 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab

Class-uniformly resolvable pairwise bala

Class-uniformly resolvable pairwise balanced designs with block sizes two and three

✍ Esther Lamken; Rolf Rees; Scott Vanstone 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 864 KB

Lamken, E., R. Rees and S. Vanstone, Class-uniformly resolvable painvise balanced designs with block sixes two and three, Discrete Mathematics 92 (1991) 197-209. A class-uniformly resolvable pairwise balanced design CURD(K;p. r) is a pairwise balanced design (of index 1) on p points, with block sixe