ISSN:
1573-7586
Keywords:
perfect Mendelsohn packing designs
;
incomplete perfect Mendelsohn designs
;
transversal designs
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A (v, k, 1) perfect Mendelsohn packing design (briefly (v, k, 1)-PMPD) is a pair (X, A) where X is a v-set (of points) and A is a collection of cyclically ordered k-subsets of X (called blocks) such that every ordered pair of points of X appears t-apart in at most one block of A for all t = 1, 2,..., k-1. If no other such packing has more blocks, the packing is said to be maximum and the number of blocks in a maximum packing is called the packing number, denoted by P(v, k, 1). The values of the function P(v, 5, 1) are determined here for all v ≥5 with a few possible exceptions. This result is established by means of a result on incomplete perfect Mendelsohn designs which is of interest in its own right.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008200319697
Permalink
