Counting families of mutually intersecting sets

A.E. Brouwer, C.F. Mills, W.H. Mills, A. Verbeek

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
58 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)8/1-8
JournalThe Electronic Journal of Combinatorics
Volume20
Issue number2
Publication statusPublished - 2013

Fingerprint

Dive into the research topics of 'Counting families of mutually intersecting sets'. Together they form a unique fingerprint.

Cite this