Multicolor Sunflowers
Dhruv Mubayi, Lujia Wang

TL;DR
This paper investigates bounds on the size of multiple families of subsets of [n] that avoid certain sunflower configurations, extending classical conjectures and providing sharp bounds for sum and product cases.
Contribution
It extends the sunflower conjecture to multiple families, establishing sharp bounds on their combined sizes when avoiding specific sunflower structures.
Findings
Maximum sum of families is $(k-1)2^n+1+inom{n}{n-k+2}+ o+inom{n}{n}$ for all $n \\geq k \\geq 3$.
For three families, the maximum product is between $(1/8+o(1))2^{3n}$ and $(0.13075+o(1))2^{3n}$.
Abstract
A sunflower is a collection of distinct sets such that the intersection of any two of them is the same as the common intersection of all of them, and is smaller than each of the sets. A longstanding conjecture due to Erd\H{o}s and Szemer\'edi states that the maximum size of a family of subsets of that contains no sunflower of fixed size is exponentially smaller than as . We consider this problem for multiple families. In particular, we obtain sharp or almost sharp bounds on the sum and product of families of subsets of that together contain no sunflower of size with one set from each family. For the sum, we prove that the maximum is for all , and for the case of the product, we prove that it is between $$\left(\frac{1}{8}+o(1)\right)2^{3n}\qquad \hbox{and}…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Computational Geometry and Mesh Generation
