Bounded subcover conjecture for sunflower-free set systems
Bounded subcover conjecture for sunflower-free set systems
Let be an integer, and let be a sunflower-free -uniform set system, meaning that it contains no sunflower with the relevant number of petals.
Bounded subcover conjecture. There exist such that
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
Sign in to submit a solution.
No solutions have been posted yet.