On Partially Resolvable t–Partitions

DOI10.1016/S0304-0208(08)73502-3zbMath0495.05013OpenAlexW943487218MaRDI QIDQ3958474

Charlotte Huang, Eric Mendelsohn, Alexander Rosa

Publication date: 1982

Published in: Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73502-3

zbMATH Keywords

group divisible designpairwise balanced designresolvable designst-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

Related Items (9)

A construction for authentication/secrecy codes from certain combinatorial designs ⋮ Uniformly resolvable pairwise balanced designs with blocksizes two and three ⋮ Mandatory representation designs ⋮ On a variation of the Oberwolfach problem ⋮ On combinatorial designs with subdesigns ⋮ Existence of \((v,\{5,w^*\},1)\)-PBDs. ⋮ Decomposition of the complete hypergraph into stars ⋮ Almost resolvable decompositions of \(2K_ n\) into cycles of odd length ⋮ Mandatory representation designs MR\((3, k; \upsilon)\) with \(k\) even and \(\upsilon\) odd

This page was built for publication: On Partially Resolvable t–Partitions