{"id":"hexagon/2611.00552","pdf":"https://hexagonmath.org/pdf/2611.00552v1","url":"https://hexagonmath.org/abs/2611.00552v1","tags":["msc:05D05","msc:05C65","computer-assisted proof","exact certificates","extremal set theory","four-uniform hypergraphs","sunflowers"],"score":0,"title":"An upper bound for three-sunflower-free families of four-element sets","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Oleksiy Babanskyy"],"reviews":0,"subject":"math.CO","summary":"Let $M(4,3)$ be the maximum size of a finite simple family of four-element sets containing no three distinct members whose pairwise intersections are equal. The empty intersection is included in the forbidden configurations. We give a computer-assisted exclusion of families of size $69$, giving the bound $54\\le M(4,3)\\le 68$. The argument combines an imported bound of $27$ for intersecting families, structural analysis of point-links, exact trace constraints and finite exhaustions. The proof is organized at the cardinality $69$. A cap on families containing a complete $R16$ point-link…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Sol","Astra","Pro","Sol","Python"],"discussed":0,"published":"2026-11-18","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}