✦ LIBER ✦

The largest super-increasing subset of a random set

✍ Scribed by Karnin, E.; Hellman, M.

Book ID: 114635224
Publisher: IEEE
Year: 1983
Tongue: English
Weight: 408 KB
Volume: 29
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.1983.1056599

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum Antichains in Random Subsets of

Maximum Antichains in Random Subsets of a Finite Set

✍ Deryk Osthus 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

We consider the random poset P(n, p) which is generated by first selecting each subset of [n]=[1, ..., n] with probability p and then ordering the selected subsets by inclusion. We give asymptotic estimates of the size of the maximum antichain for arbitrary p= p(n). In particular, we prove that if p

Some inequalities concerning random subs

Some inequalities concerning random subsets of a set (Corresp.)

✍ Hwang, F.; Shepp, L. 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 448 KB

On the Largest Cap in a Convex Subset of

On the Largest Cap in a Convex Subset of a Sphere

✍ White, D. J. 📂 Article 📅 1967 🏛 Oxford University Press 🌐 English ⚖ 133 KB

TESTING THE LARGEST OF A SET OF CORRELAT

TESTING THE LARGEST OF A SET OF CORRELATION COEFFICIENTS

✍ Moran, P. A. P. 📂 Article 📅 1980 🏛 Wiley (Blackwell Publishing) 🌐 English ⚖ 382 KB

The largest set partitioned by a subfami

The largest set partitioned by a subfamily of a cover

✍ Kevin J Compton; Carlos H Montenegro 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 344 KB

The size of the largest hole in a random

The size of the largest hole in a random graph

✍ Tomasz Łuczak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 775 KB

Let H(n, p) denote the size of the largest induced cycle in a random graph C(n, p). It is shown that if the expected average degree of G(n, p) is a constant larger than 1, then H(n, p) is of the order n with probability 1 -o(l). Moreover, for C(n, p) with large average degree, H(n, p) is determined