Abstract
A family of k-element subsets of an n-element set is called 3-wise intersecting if any three members in the family have non-empty intersection. We determine the maximum size of such families exactly or asymptotically. One of our results shows that for every ϵ>0 there exists n0 such that if n>n0 and 25+ϵ<kn<12−ϵ then the maximum size is 4(n−4k−3)+(n−4k−4).
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.
