SPECTRUM OF DIRECTED KIRKMAN PACKING DESIGNS

作     者：Zhang Yan Du BeiliangDept.of Math.,Suzhou Univ.,Suzhou 215006,China. Zhang Yan;DU Beiliang

作者机构：Dept. of Math. Suzhou Univ. Suzhou China 

出 版 物：《Applied Mathematics(A Journal of Chinese Universities)》 (高校应用数学学报（英文版）（B辑）)

年 卷 期：2003年第18卷第3期

页      面：325-331页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：packing Kirkman packing Kirkman frame 

摘      要：The problem studied in this article is the directed Kirkman packing,the resolvable directed packing which requires all blocks to be of size three except that,each resolution class should contain either one block of size two(when v≡2(mod 3)) or one block of size four (when v≡1 (mod 3)).A directed Kirkman packing design DKPD(v) is a resolvable directed packing of a v-set by the maximum possible number of resolution classes of this *** article investigates the spectrum of DKPD(v) and it is found that it contains all positive integers v≥3 and v≠5,6.