Bipacking pairs by quintuples: The case 13 20

DOI10.1016/0012-365X(94)90015-9MaRDI QIDQ1336685zbMATH OpenOpenAlexFDO

Authors Ahmed M. Assaf

Publication date 8 December 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(94)90015-9

zbMATH Keywords

bipacking packing design packing problem

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Review text

A \((\nu,\kappa,\lambda)\) packing design of order \(\nu\), block size \(\kappa\), and index \(\lambda\) is a collection of \(\kappa\)-element subsets, called blocks, of a \(\nu\)-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. Packing with \(\lambda= 2\) is called bipacking. In this paper, the author solved the bipacking problem in the case \(\kappa= 5\) and \(\nu\equiv 13\pmod {20}\). Specifically he proved the following main Theorem: For all \(\nu\equiv 13\pmod {20}\), \(\nu\neq 13\), we have \(\sigma(\nu)= \psi(\nu)\), and \(\sigma(13)= \psi(13)- 1\), where \(\sigma(\nu)= \sigma(\nu,5,2)\) denotes the maximum number of blocks in a \((\nu,\kappa,\lambda)\) packing design, \(\psi(\nu,\kappa,\lambda)=\left[{\nu\over \kappa}\left[{\nu-1\over \kappa- 1} \lambda\right]\right]\), \(\psi(\nu)= \psi(\nu,5,2)\), and \([x]\) is the floor of \(x\).

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Bipacking pairs by quintuples: The case \(\nu\equiv 13\bmod 20\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336685)