✦ LIBER ✦

Voting Fairly: Transitive Maximal Intersecting Families of Sets

✍ Scribed by Daniel E. Loeb; Andrew R. Conway

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 431 KB
Volume: 91
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3103

No coin nor oath required. For personal study only.

✦ Synopsis

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 transitive for |X| <13.

📜 SIMILAR VOLUMES

Maximal s-Wise t-Intersecting Families o

Maximal s-Wise t-Intersecting Families of Sets: Kernels, Generating Sets, and Enumeration

✍ Lucia Moura 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 239 KB

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

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

Independent sets of maximal size in tens

Independent sets of maximal size in tensor powers of vertex-transitive graphs

✍ Cheng Yeaw Ku; Benjamin B. McMillan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

## Abstract Let __G__ be a connected, nonbipartite vertex‐transitive graph. We prove that if the only independent sets of maximal cardinality in the tensor product __G__ × __G__ are the preimages of the independent sets of maximal cardinality in __G__ under projections, then the same holds for all

A Family of Inequalities for Intersectin

A Family of Inequalities for Intersecting Antichain of Subsets of an n-set

✍ Changyu Wang; Huishan Zhou 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Families of Finite Sets in which No Inte

Families of Finite Sets in which No Intersection of ℓ Sets Is Covered by the Union of s Others

✍ A. D'yachkov; P. Vilenkin; D. Torney; A. Macula 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 216 KB

In 1964, Kautz and Singleton (IEEE Trans. Inform. Theory 10 (1964), 363-377) introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is covered by the union of s others (