Perfect Mendelsohn packing designs with block size five
type: Item
instance of: scholarly article
title: Perfect Mendelsohn packing designs with block size five
zbMATH Open document ID: 0910.05020
DOI: 10.1023/A:1008200319697
author: R. Julian R. Abel
author: Frank E. Bennett
author: Jianxing Yin
author: Hantao Zhang
published in: Designs, Codes and Cryptography
publication date: 1999-04-19T00:00:00Z
review text: \(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.
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 05B30
zbMATH DE Number: 1121315
zbMATH Keywords: packing designs
zbMATH Keywords: block size
reviewed by: R. G. Stanton
MaRDI profile type: Publication
full work available at URL: a:1008200319697
OpenAlex ID: W1504945463
description: scientific article; zbMATH DE number 1121315