No label defined (Q3758840)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4008407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4008407 |
Statements
1985
0 references
covering
0 references
subsets
0 references
blocks
0 references
Hasse-Minkowski theorem
0 references
0.8224676251411438
0 references
0.7769412398338318
0 references
[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.
0 references