Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
The Sunflower Conjecture Proven
Junichiro Fukuyama, The Sunflower Conjecture Proven, arXiv:2212.13609v3, revised 22 June 2026.
The manuscript claims an exponential upper bound in the uniformity for each fixed number of petals. Its Section 2 uses a spread reduction, counts of intersection sequences, and a core-selection argument. This is an unrefereed proof claim; the claim alone supplies no accepted resolution.
The arXiv record read on 15 October 2026 lists its non-exclusive distribution license; other rights are reserved. No file of this source is held.
Read status. The abstract and bibliographic record were read. The parameter setup and sequence definitions were read in the PDF text. Lemma 2.1, equation (2.3) and the Case 3 argument on printed page 4, and equation (2.4) on printed page 5, were checked against page images. No complete proof review or independent acceptance is asserted.
Bears on. Problem 20: the paper claims the full exponential sunflower bound and its sequence selection is a subject of proof examination.