✦ LIBER ✦

On the number of intersections and the ballot theorem

✍ Scribed by E. Csáki; G. Tusnády

Publisher: Springer Netherlands
Year: 1972
Tongue: English
Weight: 353 KB
Volume: 2
Category: Article
ISSN: 0031-5303
DOI: 10.1007/bf02018645

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Krull intersection theorem

✍ O. A. S. Karamzadeh 📂 Article 📅 1983 🏛 Akadmiai Kiad 🌐 English ⚖ 133 KB

On the number of latent subsets of inter

On the number of latent subsets of intersecting collections

✍ D.J. Kleitman; T.L. Magnanti 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 291 KB

The intersection numbers of a complex

✍ A. K. Dewdney 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 304 KB

The intersection numbers of a complex

✍ A. K. Dewdney 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 48 KB

On the number of complete intersection C

On the number of complete intersection Calabi-Yau manifolds

✍ Anming He; Philip Candelas 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 273 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