Lower Bounds for Cover-Free Families

[摘要] Let ${\cal F}$ be a set of blocks of a $t$-set $X$. A pair $(X,{\cal F})$ is called an $(w,r)$-cover-free family ($(w,r)-$CFF) provided that, the intersection of any $w$ blocks in ${\cal F}$ is not contained in the union of any other $r$ blocks in ${\cal

[学科分类] 离散数学和组合数学

[关键词] Lower Bound;Cover-Free Family