✦ LIBER ✦

The maximum number of disjoint pairs in a family of subsets

✍ Scribed by N. Alon; P. Frankl

Book ID: 110567459
Publisher: Springer Japan
Year: 1985
Tongue: English
Weight: 387 KB
Volume: 1
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02582924

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimum number of disjoint pairs

On the minimum number of disjoint pairs in a family of finite sets

✍ P Frankl 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 130 KB

The maximum number of arc-disjoint arbor

The maximum number of arc-disjoint arborescences in a tournament

✍ Ma Chung-fan; Cai Mao-cheng 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 2 views

## Abstract In this article, we give the maximum number of arc‐disjoint arborescences in a tournament or an oriented complete __r__‐partite graph by means of the indegrees of its vertices.

On the maximum number of disjoint triple

On the maximum number of disjoint triple systems

✍ Luc Teirlinck 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 137 KB

The triangle intersection numbers of a p

The triangle intersection numbers of a pair of disjoint s

✍ Yanxun Chang; Tao Feng; Giovanni Lo Faro; Antoinette Tripodi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 364 KB

On the maximum number of balancing subse

On the maximum number of balancing subsets

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

On the number of disjoint pairs of S-per

On the number of disjoint pairs of S-permutation matrices

✍ Yordzhev, Krasimir 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 446 KB