{"id":"palomar/PALOMAR-2026-10-22-000016","url":"https://github.com/mbucic4/erdos-szemeredi-sunflowers/tree/8b5dc7ba9fa9e64faad39a0ab5badf74cc89f8b7","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-10-22-000016-v1.json","repo":"https://github.com/mbucic4/erdos-szemeredi-sunflowers","tags":["math.CO","msc:05D05","msc:05D40","combinatorics","sunflower-conjecture","extremal-set-theory","lean"],"score":0,"title":"The Erdős–Szemerédi sunflower conjecture","trust":"high","domain":"math.CO","source":"palomar","authors":["Matija Bucić","Fankang He","Hyunwoo Lee"],"reviews":0,"subject":"math.CO","summary":"A Lean formalization of the main vector bound, the explicit set-family bound, and the no-prefactor conjecture in Proof of the Erdős-Szemerédi sunflower conjecture by Matija Bucić, Fankang He, and Hyunwoo Lee (arXiv:2610.26686). The complete proof development uses Mathlib and contains no unresolved proof holes or nonstandard axioms.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-10-22","reactions":{},"formalized":true,"formalizes":[{"title":"Proof of the Erdős-Szemerédi sunflower conjecture","identifier":"https://arxiv.org/abs/2610.26686v1","relationship":"formalizes"}]}