Geodesic
Counting families of mutually intersecting sets
The electronic journal of combinatorics, Tome 20 (2013) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 a 9-set is 14704022144627161780744368338695925293142507520 and 12553242487940503914363982718112298267975272720808010757809032705650591023015520462677475328 (roughly 1.255 . 10^91), respectively.
DOI : 10.37236/2693
Classification : 05C30, 05C75
Mots-clés : maximal linked systems, Kneser graph, counting independent sets 
@article{10_37236_2693,
     author = {A. E. Brouwer and C. F. Mills and W. H. Mills and A. Verbeek},
     title = {Counting families of mutually intersecting sets},
     journal = {The electronic journal of combinatorics},
     year = {2013},
     volume = {20},
     number = {2},
     doi = {10.37236/2693},
     zbl = {1267.05144},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2693/}
}
TY  - JOUR
AU  - A. E. Brouwer
AU  - C. F. Mills
AU  - W. H. Mills
AU  - A. Verbeek
TI  - Counting families of mutually intersecting sets
JO  - The electronic journal of combinatorics
PY  - 2013
VL  - 20
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2693/
DO  - 10.37236/2693
ID  - 10_37236_2693
ER  - 
%0 Journal Article
%A A. E. Brouwer
%A C. F. Mills
%A W. H. Mills
%A A. Verbeek
%T Counting families of mutually intersecting sets
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2693/
%R 10.37236/2693
%F 10_37236_2693
A. E. Brouwer; C. F. Mills; W. H. Mills; A. Verbeek. Counting families of mutually intersecting sets. The electronic journal of combinatorics, Tome 20 (2013) no. 2. doi: 10.37236/2693

Cité par Sources :