Abstract

Let 𝑛, 𝑠, 𝑣 be positive integers and F ⊂ 2[𝑛]. Suppose that the union of any 𝑠 sets of F has size at most 𝑠𝑣 and 𝑛 ≄ 2𝑠+3𝑣. The main result implies the best possible bound . For 𝑛 ≀ (2𝑠 − 𝑠 − 1)𝑣 the same statement is no longer true. Several statements of a similar flavor are established as well, providing further evidence for an old conjecture of the first author.

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 call

Disclaimer: 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.