Bipacking pairs by quintuples: The case \(\nu\equiv 13\bmod 20\)
type: Item
instance of: scholarly article
title: Bipacking pairs by quintuples: The case \(\nu\equiv 13\bmod 20\)
zbMATH Open document ID: 0809.05027
DOI: 10.1016/0012-365X(94)90015-9
author: Ahmed M. Assaf
published in: Discrete Mathematics
publication date: 1994-12-08T00:00:00Z
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\).
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 681687
zbMATH Keywords: packing design
zbMATH Keywords: packing problem
zbMATH Keywords: bipacking
reviewed by: Wenpeng Zhang
MaRDI profile type: Publication
cites work: The packing of pairs by quadruples
cites work: On packing designs with block size 5 and index 4
cites work: Packing designs with block size 6 and index 5
cites work: Q3978719
cites work: Packing pairs by quintuples with index 2: \(v\) odd, \(v\not\equiv 13\pmod{20}\)
cites work: Packing designs with block size 5 and index 2: The case \(\upsilon\) even
cites work: Bounds for binary codes of length less than 25
cites work: Q3686719
cites work: Q3335805
cites work: Q4190650
cites work: Optimal packings of \(K_4\)'s into a \(K_n\)
cites work: Balanced incomplete block designs and related designs
cites work: On resolvable designs
cites work: On small packing and covering designs with block size 4
cites work: Q5836512
cites work: Four pairwise orthogonal Latin squares of order 24
cites work: Q5522938
full work available at URL: 0012-365x(94)90015-9
OpenAlex ID: W1974844608
description: scientific article; zbMATH DE number 681687