A brief survey of perfect Mendelsohn packing and covering designs

DOI10.1016/S0166-218X(99)00066-9MaRDI QIDQ1302146zbMATH OpenOpenAlexWikidataFDO

Publication date 22 September 1999

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

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00066-9

incomplete designs packing and covering designs perfect Mendelsohn designs

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40)

Review text

A \((v,k,\lambda)\)-perfect Mendelsohn packing (covering) design is a collection of cyclically ordered \(k\)-subsets of a \(v\)-set (called blocks) such that every ordered pair of elements appears \(t\)-apart in at most (at least) \(\lambda\) blocks for all \(t= 1,\dots, k-1\). The packing (covering) problem is to determine the number \(P(v,k,\lambda)\) (\(C(v,k,\lambda)\)), the maximum (minimum) number of blocks in a Mendelsohn packing (covering) design, for all \(v\geq k\). This paper surveys the known results for \(k= 3,4\), and 5. Incomplete perfect Mendelsohn designs are the primary tools used. Open problems are stated for the case \(k=5\).

Recommendations

Cited in

(3)

This page was built for publication: A brief survey of perfect Mendelsohn packing and covering designs

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