Counting Families of Mutually Intersecting Sets
Counting Families of Mutually Intersecting Sets
复制标题
计算互交集的族
DOI：
10.37236/2693
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
A. Verbeek
中科院分区：
文献类型：
--
作者：
A. Brouwer;C. F. Mills;W. Mills;A. Verbeek
我们确定 9 集和 nd 上的最大相交族数 423295099074735261880。我们确定 Kneser 图 K(9; 4) 和 nd 的独立集数 366996244568643864340。我们确定 8 集和 9 集上的相交族数和 nd 14704022144627161780744368338695925293142507520 和分别为 12553242487940503914363982718112298267975272720808010757809032705650591023015520462677475328 （大约 1:255 10 91 ）。
We determine the number of maximal intersecting families on a 9-set and nd 423295099074735261880. We determine the number of independent sets of the Kneser graph K(9; 4) and nd 366996244568643864340. We determine the number of intersecting families on an 8-set and on a 9-set and nd 14704022144627161780744368338695925293142507520 and 12553242487940503914363982718112298267975272720808010757809032705650591023015520462677475328 (roughly 1:255 10 91 ), respectively.