๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Resolvable designs of finite geometry and related designs

โœ Scribed by B. T. Rumov


Publisher
SP MAIK Nauka/Interperiodica
Year
1987
Tongue
English
Weight
755 KB
Volume
41
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Class-uniformly resolvable designs
โœ Peter Danziger; Brett Stevens ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 187 KB
G-designs and related designs
โœ Kazuhiko Ushio ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 763 KB

Ushio, K., G-designs and related designs, Discrete Mathematics 116 (1993) 2999311. This is a survey on the existence of G-designs, bipartite G-designs and multipartite G-designs. organization scheme problems about BFS2, HUBFS2, BMFSz and HUBMFS,. They can be solved by constructing (u, k, 1) K,-de

Existence results for near resolvable de
โœ 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

Constructions for near resolvable design
โœ 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