✦ LIBER ✦

Near 1-designs

✍ Scribed by W.G Bridges

Book ID: 103503619
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 429 KB
Volume: 13
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90014-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Near-symmetric divisible designs

✍ Antonino Giorgio Spera 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 780 KB

Near-regularity conditions for designs

✍ Peter J. Cameron 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 548 KB

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

On near generalized balanced tournament

On near generalized balanced tournament designs

✍ E.R. Lamken 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 941 KB

Lamken, E.R., On near generalized balanced tournament designs, Discrete Mathematics 97 (1991) 279-294. A near generalized balanced tournament design, NGBTD(n, k), defined on a (kn + l)-set V, is an arrangement of the blocks of a (kn + 1, k, k -I)-BIBD defined on V into an n x (kn + 1) array so that

Constructions for near resolvable design

Constructions for near resolvable designs and BIBDs

✍ Tran van Trung 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

The purpose of this article is twofold. First, it is shown that classical inversive planes of even order can be used to construct a class of 2 -(2 2n +1, 2 n , 2 n -1) near resolvable designs, in which any two blocks have at most 2 points in common. Secondly, it is shown that a recursive constructio

Constructions for rotational near resolv

Constructions for rotational near resolvable block designs

✍ R. Julian R. Abel; Marco Buratti; Malcolm Greig; Ying Miao 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

## Abstract A (ν, __k__, __k__−1) near resolvable block design (NRBD) is __r__‐rotational over a group __G__ if it admits __G__ as an automorphism group of order (ν−1)/__r__ fixing exactly one point and acting semiregularly on the others. We give direct and recursive constructions for rotational NR