scientific article; zbMATH DE number 3924792

From MaRDI portal
Publication:3699700





Let X be a set with n elements and let \(P_ h(X)\) denote the family of h-sets of X. T(n,k,h) denotes the minimum number of h-sets of a family \(F\subset P_ h(X)\) having the property that any k-set of X includes at least an h-set of F. In this paper it is proved that \(T(11,6,3)=16\), \(T(12,6,3)=22\), \(T(10,7,4)=10\), \(T(11,8,4)=8\), \(T(9,6,4)=12\), \(T(10,6,4)=20\), T(13,5,3)\(\leq 52\) and T(15,5,3)\(\leq 89\) by generating with the help of a computer all non-isomorphic systems F having the above-mentioned property.











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 Q3699700)