Paper Info
Title
On the upper bound of the size of the r-cover-free families
Abstract
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 log 2 T(r,n) n ⩽8. log 2 r r 2 holds.
Year
DOI
Venue
1994
10.1016/0097-3165(94)90067-1
Journal of Combinatorial Theory
Keywords
Field
DocType
r-cover-free family,artificial intelligence,binary codes,upper bound,informatics,information theory,bismuth,testing
Information theory,Informatics,Discrete mathematics,Combinatorics,Combinatorial mathematics,Upper and lower bounds,Binary code,Mathematics
Journal
Volume
Issue
ISSN
66
2
Journal of Combinatorial Theory, Series A
ISBN
Citations 
PageRank 
0-7803-0878-6
46
2.35
References 
Authors
9
1
Name
Order
Citations
PageRank
M. Ruszinkó123035.16