✦ LIBER ✦

On the number of latent subsets of intersecting collections

✍ Scribed by D.J. Kleitman; T.L. Magnanti

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 291 KB
Volume: 16
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(74)90046-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results on intersecting families of

Some results on intersecting families of subsets

✍ Chuanzhong Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 520 KB

On the maximum number of balancing subse

On the maximum number of balancing subsets

✍ Seiji Nabeya 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 156 KB

A note on the intersection properties of

A note on the intersection properties of subsets of integers

✍ R.L Graham; M Simonovits; V.T Sós 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 229 KB

On the stability number of the edge inte

On the stability number of the edge intersection of two graphs

✍ Claudio Arbib; Alberto Caprara 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 38 KB

Let G be the graph obtained as the edge intersection of two graphs G 1 , G 2 on the same vertex set V . We show that if at , where α() is the cardinality of the largest stable set. Moreover, for general G 1 and G 2 , we show that α(G) R(α(G 1 ) + 1, α(G 2 ) + 1) -1, where R(k, ) is the Ramsey numbe

On Number of Circles Intersected by a Li

On Number of Circles Intersected by a Line

✍ Lu Yang; Jingzhong Zhang; Weinian Zhang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 394 KB

The number of linear extensions of subse

The number of linear extensions of subset ordering

✍ Jichang Sha; D.J. Kleitman 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 520 KB

We find asymptotic upper and lower bounds on the number of linear extensions of the containment ordering of subsets of a finite set. These agree in their most significant non-trivial terms. A related open question is described. L > 2"((n + 1)log 2 -4 log 2m -5 + o(1 ln)).