A tighter proven upper bound for the Erdős minimum overlap constant, with machine-verifiable certificates (note + code + certs).
-
Updated
Jul 4, 2026 - Python
A tighter proven upper bound for the Erdős minimum overlap constant, with machine-verifiable certificates (note + code + certs).
Open, fully rigorous re-certification of White's lower bound for Erdős's minimum-overlap problem (#36), with an independent verifier
Add a description, image, and links to the minimum-overlap-problem topic page so that developers can more easily learn about it.
To associate your repository with the minimum-overlap-problem topic, visit your repo's landing page and select "manage topics."