Math 2.0

Proposition

Erdős-Rado sunflower conjecture

Statement

The sunflower conjecture is one of several variations of the conjecture of (Erdős Rado 1960, p. 86) that for each r>2r>2, f(k,r)≤Ckf(k,r)\le C^k for some constant C>0C>0 depending only on rr. The conjecture remains open even for fixed low values of rr; for example r=3r=3; it is not known whether f(k,3)≤Ckf(k,3)\le C^k for some C>0C>0. A 2021 paper by Alweiss, Lovett, Wu, and Zhang gives the best progress towards the conjecture, proving that f(k,r)≤Ckf(k,r)\le C^k for C=O(r3log⁡(k)log⁡log⁡(k))C = O(r^3\log(k)\log\log(k)). A month after the release of the first version of their paper, Rao sharpened the bound to C=O(rlog⁡(rk))C=O(r\log(rk)); the current best-known bound is C=O(rlog⁡k)C=O(r\log k).

Further reading

  1. Wikipedia, page 8208248, revision 1372848827, Sunflower (mathematics), section Sunflower lemma and conjecture > Erdős-Rado sunflower conjecture. adopted
About this page
Tag2RNEQVPQFZ
URIm2://2RNEQVPQFZ
Kindstatement, proposition
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status 2RNEQVPQFZ.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.