scientific article; zbMATH DE number 125623

From MaRDI portal
Publication:4027337





[For the entire collection see Zbl 0745.00024.] A packing is a family \(F\) of \(k\)-subsets (blocks) of a given set of \(v\) elements such that no two elements are contained in more than one member of \(F\). The cardinality of the largest such family is denoted by \(D(2,k,v)\). Using the weight method (involving block weights and design weights) the authors improve on the classical counting bound for \(D(2,k,v)\) for various small parameter values of \(k\) and \(v\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027337)