首页> 外文期刊>Journal of Combinatorial Theory, Series A >Voting fairly: Transitive maximal intersecting families of sets
【24h】

Voting fairly: Transitive maximal intersecting families of sets

机译:公平投票:传递最大相交集集

获取原文
获取原文并翻译 | 示例
           

摘要

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. [References: 34]
机译:最大相交族(MIF)和不同的公平概念有多种应用。我们调查了有关MIF枚举的已知结果,并得出了207,650,662,008个X的相交子集的最大族的枚举,该子集的对称性对于 X <13是可传递的。(C)2000 Academic Press。 [参考:34]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号