Perfect Mendelsohn packing designs with block size five
From MaRDI portal
(Redirected from Publication:1379655)
\(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.
Recommendations
Cited in
(9)- Existence of \(r\)-fold perfect \((v,K,1)\)-Mendelsohn designs with \(K\subseteq \{4,5,6,7\}\)
- Existence of optimal strong partially balanced designs with block size five.
- The existence of perfect Mendelsohn designs with block size 7
- Resolvable perfect Mendelsohn designs with block size five
- Existence of 4-fold perfect \((v, \{5, 8\}, 1)\)-Mendelsohn designs
- Perfect Mendelsohn designs with block size six
- Special issue: 2nd Shanghai conference on designs, codes and finite geometries. Shanghai Jiao Tong Univ., Shanghai, China, May 14--18, 1996
- Recent progress on the existence of perfect Mendelsohn designs
- The existence of \(( \nu,6, \lambda\) )-perfect Mendelsohn designs with \(\lambda > 1\)
This page was built for publication: Perfect Mendelsohn packing designs with block size five
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379655)