Linear-union conjecture for sunflower-free set systems

Let kk be an integer, and let F\cal F be a sunflower-free kk-uniform set system, meaning that it contains no sunflower with the specified number of petals under consideration.

Linear-union conjecture. There exists a constant D>0D>0 such that

FFFDk2.\left|\bigcup_{F\in\cal F}F\right|\leq Dk^2.

The source states that this conjecture would imply an unconditional strong upper bound for the size of every sunflower-free kk-uniform set system. No resolution is given in the source.

Sources & referencesView supporting material

Primary source

Gábor Hegedűs, “About sunflowers”, arXiv:1804.10050 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.