Packing designs with block size 6 and index 5
A \((v,k,\lambda)\) packing design of order \(v\), block size \(k\) and index \(\lambda\) is a collection of \(k\)-element subsets, called blocks, of a \(v\)-set \(V\) such that every 2-subset of \(V\) occurs in at most \(\lambda\) blocks. The packing problem is to determine the maximum number of blocks in a packing design. The only previous work on the packing problem with \(k=6\) concerns itself with the cases where the maximum packing design is in fact a balanced incomplete block design. In this paper, the authors solve the packing problem with \(k=6\) and \(\lambda=5\) and all positive integers \(v\) with the possible exceptions of \(v=41\), 47, 53, 59, 62, 71.
- Balanced incomplete block designs and related designs
- Finite bases for some PBD-closed sets
- scientific article; zbMATH DE number 3867360 (Why is no real title available?)
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 3235247 (Why is no real title available?)
- On small packing and covering designs with block size 4
- Optimal packings of \(K_4\)'s into a \(K_n\)
- The packing of pairs by quadruples
- Packing designs with block size 5 and indexes 8, 12, 16
- Packing designs with block size 5 and index 2: The case even
- Packing pairs by quintuples with index 2: \(v\) odd, \(v\not\equiv 13\pmod{20}\)
- Bipacking pairs by quintuples: The case \(\nu\equiv 13\bmod 20\)
- Covering and packing for pairs
- Constructions of optimal packing designs
- scientific article; zbMATH DE number 638687 (Why is no real title available?)
- scientific article; zbMATH DE number 1151807 (Why is no real title available?)
- scientific article; zbMATH DE number 1409184 (Why is no real title available?)
- Packings in dodecads
- Packing designs with equal-sized holes
This page was built for publication: Packing designs with block size 6 and index 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197045)