Sciweavers

Share
COMBINATORICS
2004

Convergence in Distribution for Subset Counts Between Random Sets

8 years 11 months ago
Convergence in Distribution for Subset Counts Between Random Sets
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at least one subset is contained in another. R
Dudley Stark
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where COMBINATORICS
Authors Dudley Stark
Comments (0)
books