463
Views
0
CrossRef citations to date
0
Altmetric
Notes

An Asymptotic Version of Frankl’s Conjecture

Pages 652-654 | Received 11 Sep 2020, Accepted 26 Dec 2020, Published online: 06 Aug 2021
 

Abstract

We show that the maximum average set size in complements of union-closed families over n elements is (n+1)/2. This implies an asymptotic version of Frankl’s conjecture.

Acknowledgments

I would like to thank Sebastian Baader, Livio Liechti, Ilan Karpas, and the two referees for valuable comments, as well as Susan Jane Colley for her help in preparing this note.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.