On resolvable balanced incomplete block designs

From MaRDI portal
Publication:1217132

DOI10.1016/0097-3165(74)90093-4zbMath0305.05010OpenAlexW1979141765MaRDI QIDQ1217132

Haim Hanani

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-DesignssThe existence of doubly resolvable \((v,3,2)\)-BIBDsNesting and almost resolvability of pentagon systems3-complementary frames and doubly near resolvable (v,3,2)-BIBDsOn the Oberwolfach problem for complete multigraphsThe existence of resolvable Steiner quadruple systemsResolvable block designs in construction of approximate real MUBs that are sparseA systematical procedure in the construction of multi-level supersaturated design.The family of t-designs. Part IConstruction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designsBalanced tournament designs and resolvable (v,3,2)-BIBDsConstructions of uniform designs by using resolvable packings and coverings.Unnamed ItemSpectrum of directed Kirkman packing designsDecomposable super‐simple NRBIBDs with block size 4 and index 6Embeddings of resolvable triple systemsA survey of Kirkman triple systems and related designsThe spectrum of \(\alpha\)-resolvable block designs with block size 3On near generalized balanced tournament designsOn the construction of \(q\)-ary equidistant codesExistence results for doubly near resolvable \((v,3,2)\)-BIBDsHanani triple systemsRecursive constructions for cyclic BIB designs and their generalizationsResolvable decomposition of \(K^*_n\)Resolvable group divisible designs with block size 3Balanced tournament designs and related topicsAlmost resolvable decomposition of K//n*Resolvable systems of 8-tuplesResolvable BIBD and SOLSA new extremal property of Steiner triple-systemsMinimum matrix representation of closure operationsNear 2-factorizations of \(2K_ n:\) Cycles of even length



Cites Work


This page was built for publication: On resolvable balanced incomplete block designs