|
|
|
|
|
|||
| |
|||
 What is a Covering Design? A Covering Design C(v,k,t,m,l,=b) is a pair (V,B), where V is a set of v elements (called points) and B is a collection of b k-subsets of V (called blocks), such that every m-subset of V intersects at least l members of B in at least t points. It is required that v >= k >= t and m >= t. The case m > k is also a valid case. B can be a multiset.
|
|||
|
|||
|
|||
|
|||
 
For more informations visit our Combinatorics page. Click here |
|||
|
|||
|
|||
|
|||
|
|||
|
|||
 
|
|||
For more information see our Glossary page. Click here
|
LE FastCounter |
||||
|
