On resolvable balanced incomplete block designs
From MaRDI portal
Publication:1217132
DOI10.1016/0097-3165(74)90093-4zbMath0305.05010OpenAlexW1979141765MaRDI QIDQ1217132
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(74)90093-4
Related Items (32)
Construction of Uniform Designs and Complex-Structured Uniform Designs via Partitionable t-Designss ⋮ The existence of doubly resolvable \((v,3,2)\)-BIBDs ⋮ Nesting and almost resolvability of pentagon systems ⋮ 3-complementary frames and doubly near resolvable (v,3,2)-BIBDs ⋮ On the Oberwolfach problem for complete multigraphs ⋮ The existence of resolvable Steiner quadruple systems ⋮ Resolvable block designs in construction of approximate real MUBs that are sparse ⋮ A systematical procedure in the construction of multi-level supersaturated design. ⋮ The family of t-designs. Part I ⋮ Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs ⋮ Balanced tournament designs and resolvable (v,3,2)-BIBDs ⋮ Constructions of uniform designs by using resolvable packings and coverings. ⋮ Unnamed Item ⋮ Spectrum of directed Kirkman packing designs ⋮ Decomposable super‐simple NRBIBDs with block size 4 and index 6 ⋮ Embeddings of resolvable triple systems ⋮ A survey of Kirkman triple systems and related designs ⋮ The spectrum of \(\alpha\)-resolvable block designs with block size 3 ⋮ On near generalized balanced tournament designs ⋮ On the construction of \(q\)-ary equidistant codes ⋮ Existence results for doubly near resolvable \((v,3,2)\)-BIBDs ⋮ Hanani triple systems ⋮ Recursive constructions for cyclic BIB designs and their generalizations ⋮ Resolvable decomposition of \(K^*_n\) ⋮ Resolvable group divisible designs with block size 3 ⋮ Balanced tournament designs and related topics ⋮ Almost resolvable decomposition of K//n* ⋮ Resolvable systems of 8-tuples ⋮ Resolvable BIBD and SOLS ⋮ A new extremal property of Steiner triple-systems ⋮ Minimum matrix representation of closure operations ⋮ Near 2-factorizations of \(2K_ n:\) Cycles of even length
Cites Work
- Unnamed Item
- Unnamed Item
- On balanced incomplete block designs with blocks having five elements
- On resolvable designs
- On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- The Existence and Construction of Balanced Incomplete Block Designs
- On the number of orthogonal latin squares
This page was built for publication: On resolvable balanced incomplete block designs