Resolvable packings RMP(3,2;n,n-3) and coverings RMC(3,2;n,n-2)

DOI10.1016/J.DISC.2006.03.005MaRDI QIDQ2497504zbMATH OpenOpenAlexFDO

Authors H. Cao

Publication date 4 August 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.03.005

zbMATH Keywords

frame uniform design

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Review text

Let \(n\equiv k-1,\;0\) or \(1\) (mod \(k\)). An \~{R}MP\((k,\lambda;n,m)\) (respectively \~{R}MC\((k,\lambda;n,m))\) is a resolvable packing (covering) on \(n\) points with the following properties: (1) it contains the maximum (minimum) number \(m\) of parallel classes which are mutually distinct; (2) each parallel class consists of \(\lfloor (n-k+1)/k\rfloor\) blocks of size \(k\) and one block of size \(n-k\lfloor(n-k+1)/k\rfloor\); (3) its leave (excess) is a simple graph. These designs can be used to construct uniform designs which are used in a number of different applications in industry. The author uses standard direct and recursive constructions to construct resolvable packings and coverings for \(k=3\) and \(\lambda=2\). In particular, the existence of \~{R}MP\((3,2;n,n-3)\) and \~{R}MC\((3,2;n,n-2)\) for \(n\equiv 1\pmod{3}\) and \(n\geq 16\) are established in this paper.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Resolvable packings \(\widetilde{\text{R}}\text{MP}(3,2;n,n-3)\) and coverings \(\widetilde{\text{R}}\text{MC}(3,2;n,n-2)\)

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