ON THE UPPER BOUND OF THE SIZE OF THE R-COVER-FREE FAMILIES

[摘要] Let T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the title. It is proved in a purely combinatorial way that for n sufficiently large log2 T(r, n)/n less-than-or-equal-to 8. log2r/r2, holds. (C) 1994 Academic Press, Inc.

[发布日期] 1994-05-01