scientific article; zbMATH DE number 4008407

From MaRDI portal
Publication:3758840





[For the entire collection see Zbl 0619.00006.] Let V be a finite set of v elements. A covering of the pairs of V by k- sets is a family F of k-subsets of V, called blocks, such that each pair of V occurs in at least one member of F. We are interested in coverings of the pairs of an \(n^ 2+n\) set with \(n^ 2+n\) blocks of size \(n+1\), where n is a positive integer. We provide a short proof of a necessary condition for the existence of such coverings. We then apply the Hasse- Minkowski theorem to extend the results and provide two non-existence results.











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