For fixed s, n, k, and t, let I s (n, k, t) denote the set of all such families. A family A # I s (n, k, t) is said to be maximal if it is not properly contained in any other family in I s (n, k, t). We show that for fixed s, k, t, there is an integer n 0 =n 0 (k, s, t), for which the maximal famili
Enumeration of intersecting families
✍ Scribed by P Erdös; N Hindman
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 184 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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 a
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