TY - JOUR
T1 - Tracing a single user
AU - Alon, Noga
AU - Asodi, Vera
N1 - Funding Information:
The first author’s research was supported in part by a USA–Israeli BSF grant, by the Israel Science Foundation and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University.
PY - 2006/11
Y1 - 2006/11
N2 - Let g (n, r) be the maximum possible cardinality of a family F of subsets of {1, 2, ..., n} so that given a union of at most r members of F, one can identify at least one of these members. The study of this function is motivated by questions in molecular biology. We show that g (n, r) = 2Θ (frac(n, r)), thus solving a problem of Csu{double acute}rös and Ruszinkó.
AB - Let g (n, r) be the maximum possible cardinality of a family F of subsets of {1, 2, ..., n} so that given a union of at most r members of F, one can identify at least one of these members. The study of this function is motivated by questions in molecular biology. We show that g (n, r) = 2Θ (frac(n, r)), thus solving a problem of Csu{double acute}rös and Ruszinkó.
UR - http://www.scopus.com/inward/record.url?scp=33748563108&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33748563108&partnerID=8YFLogxK
U2 - 10.1016/j.ejc.2006.05.001
DO - 10.1016/j.ejc.2006.05.001
M3 - Article
AN - SCOPUS:33748563108
SN - 0195-6698
VL - 27
SP - 1227
EP - 1234
JO - European Journal of Combinatorics
JF - European Journal of Combinatorics
IS - 8 SPEC. ISS.
ER -