AbstractThe packing number P(r,k,v) is defined to be the minimum number of non-empty subsets of cardinality ⩽k needed to contain each element of a set of cardinality v exactly r times, with no pair of distinct elements occuring more than once. The packing numbers P(3,4,v), P(5,3,v) and P(6,3,v) are completely determined and some other packing numbers determined. Tables of known packing numbers are given
AbstractIn this paper we improve and generalize the results of two earlier papers of Skillicorn. The...
AbstractA (υ, κ, λ) packing design of order υ, block size κ, and index λ is a collection of κ-elemen...
AbstractA (2,3)-packing on X is a pair (X,A), where A is a set of 3-subsets (called blocks) of X, su...
AbstractA (v,k,λ) packing design of order v, block size k, and index λ is a collection of k-element ...
AbstractA (υ, κ, λ) packing design of order υ, block size κ, and index λ is a collection of κ-elemen...
AbstractIn this paper we determine the maximum cardinality of a packing of K4's into Kn, that is, co...
summary:Let $E$ be an $n$-set. The problem of packing of pairs on $E$ with a minimum number of quadr...
AbstractA (v, k, λ) packing design of order v, block size k, and index λ is a collection of k-elemen...
AbstractA (ν, κ, λ) packing design of order ν, block size κ, and index λ is a collection of κ-elemen...
summary:Let $E$ be an $n$-set. The problem of packing of pairs on $E$ with a minimum number of quadr...
AbstractWe determine (leaving a few cases) the spectrum of support sizes for a maximum packing of tr...
AbstractA packing (respectively covering) design of order v, block size k, and index λ is a collecti...
AbstractAn (υ, κ, λ) packing design of order υ, block size κ, and index λ is a collection of κ-eleme...
AbstractLet X be a finite set of size ν, further let λ be a positive integer and let σ(4,λν) denote ...
AbstractA Kirkman packing design KPD({3,4∗∗},v), is a resolvable packing of a v-set by the maximum p...
AbstractIn this paper we improve and generalize the results of two earlier papers of Skillicorn. The...
AbstractA (υ, κ, λ) packing design of order υ, block size κ, and index λ is a collection of κ-elemen...
AbstractA (2,3)-packing on X is a pair (X,A), where A is a set of 3-subsets (called blocks) of X, su...
AbstractA (v,k,λ) packing design of order v, block size k, and index λ is a collection of k-element ...
AbstractA (υ, κ, λ) packing design of order υ, block size κ, and index λ is a collection of κ-elemen...
AbstractIn this paper we determine the maximum cardinality of a packing of K4's into Kn, that is, co...
summary:Let $E$ be an $n$-set. The problem of packing of pairs on $E$ with a minimum number of quadr...
AbstractA (v, k, λ) packing design of order v, block size k, and index λ is a collection of k-elemen...
AbstractA (ν, κ, λ) packing design of order ν, block size κ, and index λ is a collection of κ-elemen...
summary:Let $E$ be an $n$-set. The problem of packing of pairs on $E$ with a minimum number of quadr...
AbstractWe determine (leaving a few cases) the spectrum of support sizes for a maximum packing of tr...
AbstractA packing (respectively covering) design of order v, block size k, and index λ is a collecti...
AbstractAn (υ, κ, λ) packing design of order υ, block size κ, and index λ is a collection of κ-eleme...
AbstractLet X be a finite set of size ν, further let λ be a positive integer and let σ(4,λν) denote ...
AbstractA Kirkman packing design KPD({3,4∗∗},v), is a resolvable packing of a v-set by the maximum p...
AbstractIn this paper we improve and generalize the results of two earlier papers of Skillicorn. The...
AbstractA (υ, κ, λ) packing design of order υ, block size κ, and index λ is a collection of κ-elemen...
AbstractA (2,3)-packing on X is a pair (X,A), where A is a set of 3-subsets (called blocks) of X, su...