Take sets of numbers. A "sunflower" is a group of sets that all overlap in exactly the same core. Everything else, the petals, never touches. Mathematicians love them.
In the 1970s, Erdős and Szemerédi asked: how many sets can you collect without any k of them forming a sunflower? Their guess: exponentially fewer than all possible sets. Only the three-petal case was settled, in 2016.
Now three mathematicians from Vienna and KAIST prove it for every number of petals. The limit: 3 × (2 − 1/16k³) to the power n. Close to 2ⁿ, yet exponentially smaller.
The key step was found by ChatGPT 6 Astra Pro. The authors rewrote it, checked it, and had the proof verified by the Lean software.
Source: Proof of the Erdős-Szemerédi sunflower conjecture, https://arxiv.org/abs/2610.26686










