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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
