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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Sol, Astra, Pro, Sol, Python Discussed: 0 Published: 2026-11-18 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00552 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…