Root cases of large sets of t-designs

Abstract

A large set of t-(v, k, λ) designs of size N , denoted by LS[N ](t, k, v), is a partition of all k-subsets of a v-set into N disjoint t-(v, k, λ) designs, where N = ( v−t k−t ) /λ. A set of trivial necessary conditions for the existence of an LS[N ](t, k, v) is N ∣∣(v−i k−i ) for i = 0, . . . , t. In this paper we extend some of the recursive methods for… (More)
DOI: 10.1016/S0012-365X(02)00574-5

1 Figure or Table

Topics

  • Presentations referencing similar topics