✦ LIBER ✦

Resolvable path designs

✍ Scribed by J.D Horton

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 666 KB
Volume: 39
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90033-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Doubly resolvable designs

✍ S.A. Vanstone 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 998 KB

Class-uniformly resolvable designs

✍ Peter Danziger; Brett Stevens 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

On resolvable PBIB designs

✍ Kishore Sinha; Aloke Dey 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 371 KB

On μ-resolvable BIB designs

✍ Sanpei Kageyama; R.N. Mohan 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 898 KB

Strongly resolvable (r, λ)-designs

✍ Albrecht Beutelspacher; Ulf Lamberty 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 1007 KB

The aim of this paper is to show the following Theorem: If D is an (r, A)-design (regular pairwise balanced design) with a resolution having c classes, then b + 12 u + c. EZquality holds if and only if the number of points on two distinct blocks depends only on the classes, the two blocks belong to.

Existence results for near resolvable de

Existence results for near resolvable designs

✍ Steven Furino 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 572 KB

A near resolvable design, NRB(v, k), is a balanced incomplete block design whose block set can be partitioned into v classes such that each class contains every point of the design but one, and each point is missing from exactly one class. The necessary conditions for the existence of near resolvabl