Abstract
Let be a set of blocks of a -set . is called -cover-free family (CFF) provided that, the intersection of any blocks in is not contained in the union of any other blocks in . We give new asymptotic lower bounds for the number of minimum points in a -CFF when for some constant .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.