Ka ɗauki tarin lambobi (sets). "Sunflower" rukuni ne na tarin da dukkansu ke haɗuwa a tsakiya ɗaya daidai. Duk sauran, wato ganyen fure (petals), ba sa taɓa juna. Masana lissafi suna son su.
A shekarun 1970, Erdős da Szemerédi sun tambaya: tarin nawa za ka iya tattarawa ba tare da wani k daga cikinsu ya zama sunflower ba? Hasashensu: ƙasa da dukkan tarin da za a iya samu ta hanyar exponential. Yanayin ganye uku kawai aka warware, a 2016.
Yanzu masana lissafi uku daga Vienna da KAIST sun tabbatar da shi ga kowane adadin ganyen fure. Iyakar: 3 × (2 − 1/16k³) zuwa ƙarfin n. Kusa da 2ⁿ, amma ƙarami ta hanyar exponential.
ChatGPT 6 Astra Pro ne ya sami babban matakin. Marubutan sun sake rubuta shi, sun duba shi, kuma manhajar Lean ta tabbatar da hujjar.
Tushe: Proof of the Erdős-Szemerédi sunflower conjecture, https://arxiv.org/abs/2610.26686










