A construction for resolvable designs and its generalizations
DOI10.1007/PL00007217zbMATH Open0895.05010OpenAlexW2017682225MaRDI QIDQ1385296FDOQ1385296
Authors: Sanpei Kageyama, Ying Miao 
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
Recommendations
framesresolvable designsgroup divisible designsfree difference familiesresolvable perfect Mendelsohn designs
Combinatorial aspects of block designs (05B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Cited In (16)
- The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class
- Recursive constructions for \(s\)-resolvable \(t\)-designs
- Title not available (Why is that?)
- A combinatorial structure of affine \((\alpha _1,\dots ,\alpha _t)\)-resolvable \((r,\lambda )\)-designs.
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs
- Doubly resolvable canonical Kirkman packing designs and its applications
- New product theorems for \(Z\)-cyclic whist tournaments
- Ring-valud assignments, \(t\)-designs and difference families
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resolvable designs of finite geometry and related designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete sets of disjoint difference families and their applications
- Title not available (Why is that?)
- CONSTRUCTION OF RESOLVABLE ROW-COLUMN DESIGNS BASED ON CONTRACTIONS
This page was built for publication: A construction for resolvable designs and its generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385296)
