Perfect Mendelsohn packing designs with block size five (Q1379655)

\(P(v,k,1)\) is the maximum number of cyclically ordered \(k\)-subsets from a set of \(v\) elements such that every ordered pair of elements occurs \(t\) units apart in at most one of the subsets, where \(t\) range from \(1\) to \(k-1\). The authors treat the case \(k=5\) and obtain results for all \(v\), with a small number of exceptions.