×

The directed packing numbers DD(t,v,v), t\(\geq 4\). (English) Zbl 0554.05018

A directed packing is a maximal collection of k-subsets of a set of cardinality v having the property that no ordered t-subset occurs in more than one k-subset. Some results are derived in the case that \(k=v\).
Reviewer: R.G.Stanton

MSC:

05B40 Combinatorial aspects of packing and covering
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] P. Erdös andG. Szekerfs, A Combinatorial Problem in Geometry,Compositio Mathemativa 2 (1935), 463–470. · Zbl 0012.27010
[2] R. G. Stanton andD. B. Skillicorn, The Directed Packing NumbersDD(3,v, v),Proceedings of 11th Manitoba Conference on Numerical Mathematics and Computing, to appear. · Zbl 0542.05025
[3] D. B. Skillicorn,Directed Packings and Coverings with Computer Applications, Ph. D. Thesis, University of Manitoba, 1981. · Zbl 0471.05021
[4] J. E. Dawson, Algorithms to find directed packings,Annals of Discrete Mathematics, to appear. · Zbl 0579.05044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.