number of k-subsets of an n-set so that the size of the intersection of any two among them is in L. It is proven that for every rational number r 2 1 there is a choice of k and L so that cn'<m(n, k, L) idn', where c, d depend on k and L but not on n. 0 1986 Academic Press. Inc