A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Convergence in Distribution for Subset Counts Between Random Sets

2004
*
Electronic Journal of Combinatorics
*

Erdős 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ényi answered this question, but could not determine the limiting probability distribution for the number of subset counts because the higher moments diverge to infinity. The model considered by Rényi with $p$ arbitrary is denoted by ${\cal P}(m,n,p)$, where $m$ is the number

doi:10.37236/1812
fatcat:2j26r4cambgezaxol235s2b7oi