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}
โฆ LIBER โฆ
Intersections of Markov random sets
โ Scribed by John Hawkes
- Publisher
- Springer
- Year
- 1977
- Tongue
- English
- Weight
- 359 KB
- Volume
- 37
- Category
- Article
- ISSN
- 1432-2064
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The intersection graph of random sets
โ
Hiroshi Maehara
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 369 KB
Measure of the multiple self-intersectio
โ
Simeon M. Berman
๐
Article
๐
1990
๐
John Wiley and Sons
๐
English
โ 908 KB
Intersections of spherically convex sets
โ
L. G. Sharaburova; Yu. A. Shashkin
๐
Article
๐
1975
๐
SP MAIK Nauka/Interperiodica
๐
English
โ 410 KB
Reconstructing dimensions of intersectio
โ
M. Katchalski
๐
Article
๐
1978
๐
Springer
๐
English
โ 244 KB
Intersection of random sequences
โ
G. P. Klimov; V. F. Matveev
๐
Article
๐
1986
๐
SP MAIK Nauka/Interperiodica
๐
English
โ 270 KB
Intersecting Balanced Families of Sets
โ
Adam Idzik; Gyula O.H. Katona; Rajiv Vohra
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 117 KB
Suppose that any t members (t 2) of a regular family on an n element set have at least k common elements. It is proved that the largest member of the family has at least k 1รt n 1&1รt elements. The same holds for balanced families, which is a generalization of the regularity. The estimate is asympto