Counting Families of Mutually Intersecting Sets

Electronic Journal Of Combinatorics

A. E. Brouwer¹ 

关键词: maximal linked systems;    Kneser graph;    counting independent sets;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We show that the number of maximal intersecting families on a 9-set equals 423295099074735261880, that the number of independent sets of the Kneser graph K(9,4) equals 366996244568643864340, and that the number of intersecting families on an 8-set and on

【 授权许可】

Others