{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:59Z","timestamp":1753893839652,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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.\u00a0<\/jats:p>","DOI":"10.37236\/2693","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T05:14:23Z","timestamp":1578719663000},"source":"Crossref","is-referenced-by-count":4,"title":["Counting Families of Mutually Intersecting Sets"],"prefix":"10.37236","volume":"20","author":[{"given":"A. E.","family":"Brouwer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. F.","family":"Mills","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. H.","family":"Mills","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Verbeek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2013,4,9]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i2p8\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i2p8\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:23:07Z","timestamp":1579260187000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i2p8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,9]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,4,9]]}},"URL":"https:\/\/doi.org\/10.37236\/2693","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,4,9]]},"article-number":"P8"}}