Modular and modern graph-theory algorithms framework in Java
A toolkit for AI agents to explore and attempt Erdős's 1,179 unsolved mathematical problems
Certified unit-distance point sets and graphs for discrete geometry in Rust.
CLI and workspace for Paul Erdos problems.
Independent Python reproduction of the 2026 OpenAI/Sawin disproof of the Erdős unit-distance conjecture. mpmath-200-bit verbatim match (0.01% rel.err) to equation (2.2) of the remarks PDF. MIT, NumPy + mpmath only.
Computational evidence isolating the log(n) spreadness artifact in the Erdős k=3 Sunflower Conjecture via bitmask-accelerated Simulated Annealing.
Erdos-SDSLabs solutions using Python (Mostly)
A tighter proven upper bound for the Erdős minimum overlap constant, with machine-verifiable certificates (note + code + certs).
Computational experiments for Erdős-style combinatorial conjectures
Proof package for a certified pointwise lower bound in the Erdős unit-distance problem
Reproducible generator for Erdős problem LaTeX, metadata, status, formalization, and AI provenance
Computer-assisted proof and reproducibility package for Erdős Problem 848, with exact certificates and separately implemented checkers.
An adversarially-verified compendium: 8 Putnam proofs + 8 open Erdős surveys, built by a 110-agent fleet (Fable conducted, Opus solved/verified, Sonnet typeset).
SAT + verified LRAT certificate for a covering-system lower bound (Erdős #273), plus a segmented sieve extending verified ranges for #385 and #647 to 1.0011e12
Reproducing AlphaEvolve's SOTA bound on the Erdős minimum-overlap problem with an evolutionary LLM pipeline (OpenEvolve) — converges in ~10 iterations, two independent backends, one-command verifier
To associate your repository with the erdos topic, visit your repo's landing page and select "manage topics."