Abstract

The union-closed sets conjecture states that if a finite family of sets $\mathcal{A} \neq \{\varnothing\}$ is union-closed, then there is an element which belongs to at least half the sets in $\mathcal{A}$. In 2001, D. Reimer showed that the average set size of a union-closed family, $\mathcal{A}$, is at least $\frac{1}{2} \log_2 |\mathcal{A}|$. In order to do so, he showed that all union-closed families satisfy a particular condition, which in turn implies the preceding bound. Here, answering a question raised in the context of T. Gowers' polymath project on the union-closed sets conjecture, we show that Reimer's condition alone is not enough to imply that there is an element in at least half the sets.

Highlights

  • Given the set [n] = {1, . . . , n} and a family A ⊆ 2[n] we say A is union-closed if for A, B ∈ A we have A ∪ B ∈ A

  • Gowers’ polymath project on the union-closed sets conjecture, we show that Reimer’s condition alone is not enough to imply that there is an element in at least half the sets

  • Gowers began a polymath project focused on the union-closed sets conjecture

Read more

Summary

Introduction

In order to do so, he showed that all union-closed families satisfy a particular condition, which in turn implies the preceding bound. Gowers’ polymath project on the union-closed sets conjecture, we show that Reimer’s condition alone is not enough to imply that there is an element in at least half the sets. The Union-Closed Sets Conjecture, due to P. Frankl [3], states that if A ⊆ 2[n] is union-closed and A = {∅} there is some element of [n] which belongs to at least half the sets in A.

Results
Conclusion
Full Text
Paper version not known

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.