Tracing a single user

Noga Alon, Vera Asodi

Research output: Contribution to journalArticle

7 Scopus citations

Abstract

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ó.

Original languageEnglish (US)
Pages (from-to)1227-1234
Number of pages8
JournalEuropean Journal of Combinatorics
Volume27
Issue number8 SPEC. ISS.
DOIs
StatePublished - Nov 2006
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Tracing a single user'. Together they form a unique fingerprint.

  • Cite this