scientific article; zbMATH DE number 17507
[For the entire collection see Zbl 0726.00009.] An \(S_ \lambda(2,k,v)\) is a pair \((V,B)\) where \(V\) is a \(v\)-set and \(B\) is a collection of \(k\)-subsets, called blocks, of \(V\) such that any pair of distinct elements of \(V\) is contained in exactly \(\lambda\) blocks. A parallel class is a set of blocks partitioning \(V\). An \(S_ \lambda(2,k,v)\) is called resolvable if \(B\) can be partitioned into parallel classes. An \(S_ \lambda(2,k,v)\) is called simple if it has no repeated blocks. \textit{Shen Hao} [Science Bulletin 33, 1855-1857 (1988)] proved that a simple resolvable \(S_ 2(2,3,v)\) exists iff \(v\equiv 0\pmod 3\), \(v>6\). In the present paper, the authors prove that the obvious necessary conditions for the existence of a simple resolvable \(S_ \lambda(2,4,v)\) are sufficient for \(\lambda\in\{2,4,5\}\) and sufficient with two possible exceptions (namely \(v=44\) and \(v=284)\) for \(\lambda=3\).
- scientific article; zbMATH DE number 22638
- On the existence of super-simple designs with block size 4
- Super-simple resolvable balanced incomplete block designs with block size 4 and index 3
- Super‐simple resolvable balanced incomplete block designs with block size 4 and index 2
- scientific article; zbMATH DE number 3981177
- Maximum uniformly resolvable designs with block sizes 2 and 4
- On resolvable designs \(S_ 3(3;4,v)\)
- Existence of resolvable group divisible designs with block size four. I
- On the existence of super-simple designs with block size 4
- Completely reducible super-simple designs with block size four and related super-simple packings
- The Existence of r\times4 Grid-Block Designs with r=3,4
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974830)
