✦ LIBER ✦

1-Intersecting families

✍ Scribed by M. Habib; M.C. Maurer

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 555 KB
Volume: 53
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90132-3

No coin nor oath required. For personal study only.

✦ Synopsis

We study subset families of a finite set that come from combinatorial decomposition theories such as graph substitution decomposition, boolean function decomposition, hypergraph or clutter substitution decomposition; see Omningham and Edmonds' paper [6].

We consider these families as ordered sets and we obtain characterization theorems in some particular cases. This gives us uniqueness decomposition results.

📜 SIMILAR VOLUMES

Maximal intersecting families

✍ Aaron Meyerowitz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 542 KB

Enumeration of intersecting families

✍ P Erdös; N Hindman 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 184 KB

On cross-intersecting families

✍ P. Frankl 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 214 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

On families of intersecting sets

✍ Andrzej Ehrenfeucht; Jan Mycielski 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 81 KB

Weighted 3-Wise 2-Intersecting Families

✍ Peter Frankl; Norihide Tokushige 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 190 KB