Intersection of independent regenerative sets
β Scribed by Jean Bertoin
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 173 KB
- Volume
- 114
- Category
- Article
- ISSN
- 1432-2064
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A family of r sets is called a 2-system if any two sets have the same intersection. Denote by F(n, r) the most number of subsets of an n-element set which do not contain a 2-system consisting of r sets. Constructive new lower bounds for F(n, r) are given which improve known probabilistic results, an
Maehara, H., The intersection graph of random sets, Discrete Mathematics 87 (1991) 97-104. Let X,, i=l,..., n, be n = n(N) independent random subsets of {1,2,. . , N}, each selected at random out of the 2N subsets. We present some asymptotic (N-tm) properties of {Xi}, e.g. if r~/2~'~--+ m then {Xi}