Abstract
Let F ⊂ 2 [n] be a family in which any three sets have non-empty intersection and any two sets have at least 32 elements in common. The nearly best possible bound F ≤ 2n−2 is proved. We believe that 32 can be replaced by 3 and provide a simple-looking conjecture that would imply this.
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.
