Maximal intersecting families
β Scribed by Aaron Meyerowitz
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 542 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
There are several applications of maximal intersecting families (MIFs) and different notions of fairness. We survey known results regarding the enumeration of MIFs, and we conclude the enumeration of the 207,650,662,008 maximal families of intersecting subsets of X whose group of symmetries is trans
A finite family of pairwise intersecting r-sets is a maximal r-clique if it cannot be extended to another r-clique by adding a new r-set. It is intersection critical if it is not possible to replace any edge by some of its proper subsets, without violating the intersection property. We prove that i
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
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