Abstract

Let F{\cal F} be a set of blocks of a tt-set XX. (X,F)(X,{\cal F}) is called (w,r)(w,r)-cover-free family ((w,r)−(w,r)-CFF) provided that, the intersection of any ww blocks in F{\cal F} is not contained in the union of any other rr blocks in F{\cal F}. We give new asymptotic lower bounds for the number of minimum points tt in a (w,r)(w,r)-CFF when w≤r=∣F∣εw\le r=|{\cal F}|^ε for some constant ε≥1/2ε\ge 1/2.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.