Voting fairly: Transitive maximal intersecting families of sets

被引：7
|
作者：
Loeb, DE
Conway, AR
机构：
[1] Daniel H Wagner Associates, Malvern, PA 19355 USA
[2] Silicon Genet, Redwood City, CA 94063 USA
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES A | 2000年 / 91卷 / 1-2期
关键词：
homogeneous games; fair; transitive; regular; coterie; maximal intersecting family; strong simple game; voting scheme; ipsodual clement of free distributive lattice; self-dual monotone Boolean function; self-dual anti-chain; critical tripartite hypergraph;
D O I：
10.1006/jcta.2000.3103
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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. (C) 2000 Academic Press.
引用
收藏
页码：386 / 410
页数：25
相关论文
共 50 条
12345