A construction for resolvable designs and its generalizations

DOI10.1007/PL00007217zbMath0895.05010OpenAlexW2017682225MaRDI QIDQ1385296

Ying Miao, Sanpei Kageyama

Publication date: 14 September 1998

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00007217

zbMATH Keywords

framesresolvable designsgroup divisible designsfree difference familiesresolvable perfect Mendelsohn designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items (3)

The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class ⋮ Complete sets of disjoint difference families and their applications ⋮ New product theorems for \(Z\)-cyclic whist tournaments

This page was built for publication: A construction for resolvable designs and its generalizations