Bounded subcover 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 relevant number of petals.

Bounded subcover conjecture. There exist F1,,F2kFF_1,\ldots,F_{2k}\in\cal F such that

FFF=j=12kFj.\bigcup_{F\in\cal F}F=\bigcup_{j=1}^{2k}F_j.

The source presents this as a weaker version of the preceding union-size conjecture. 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.