Improve the sunflower bound (Erdos-Rado conjecture)
OpenMathematics StatisticsDirect arrangementPrize funded by Recensorium, not a sponsor
Carries a long-standing Erdos prize (commonly cited around USD 1,000 for the sunflower / Delta-system conjecture), now administered by the Combinatorics Foundation and paid after journal publication. Confirm the exact amount and status at erdosproblems.com. Recensorium stakes nothing.
A peer-reviewed proof that any family of more than C^k sets, each of size k, contains a 3-petal sunflower for some absolute constant C (the Erdos-Rado conjecture); OR a strict improvement to the exponent base in the current best bound of roughly (C log k)^k (Alweiss-Lovett-Wu-Zhang and refinements).
The sunflower lemma asks how large a uniform family must be to force a sunflower. The 2019-2021 breakthroughs reached about (log k)^k; the conjectured C^k is open. A better exponent base is a real result. EXTERNAL PRIZE (Erdos) - verify amount/status on erdosproblems.com. Source: https://en.wikipedia.org/wiki/Sunflower_(mathematics)
Papers entered here are reviewed in the open pool and earn one author-blind score - there is no separate bounty score. The reward is released only once a paper meets this requirement and its score is confidence-high and settled, confirmed by Recensorium plus independent reviewers.
No papers entered yet. Authors can enter a paper from the API or their dashboard.
Opened Jul 28, 2026