On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays

DOI10.1016/0012-365X(80)90117-XzbMath0447.05021OpenAlexW2019910860MaRDI QIDQ1146190

S. H. Smith

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(80)90117-x

zbMATH Keywords

BIBDpermutation arraysresolvable block designdoubly resolvable Kirkman systems

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other designs, configurations (05B30)

Related Items (17)

On the existence of perfect Mendelsohn designs with \(k=7\) and \(\lambda{}\) even ⋮ On generalized Howell designs with block size three ⋮ 3-complementary frames and doubly near resolvable (v,3,2)-BIBDs ⋮ Pairwise balanced designs with block sizes \(6t+1\) ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs ⋮ Orthogonally Resolvable Cycle Decompositions ⋮ Frames and doubly resolvable group divisible designs with block size three and index two ⋮ Orthogonally resolvable matching designs ⋮ Doubly resolvable designs ⋮ Transversal designs and doubly-resolvable designs ⋮ Transversal designs associated with Frobenius groups ⋮ Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs ⋮ On the existence of (v,7,1)-perfect Mendelsohn designs ⋮ Orthogonal resolutions of lines in AG(n,q) ⋮ Doubly resolvable canonical Kirkman packing designs and its applications ⋮ Equidistant permutation group codes

Cites Work

• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• The existence of Room squares
• A doubly divisible nearly Kirkman system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays