Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_09_24_openai: The OpenAI mathematics release's preprint of 24 September 2026 proves that for one absolute C every graph on n vertices partitions into at most Cn cycles and single edges; accepted on the corpus's build and audit of its Lean.
2026_10_01_coffey: Ryan Coffey's paper and Lean 4 development of 1 October 2026 proving the formal-conjectures statement erdos_184 unchanged, so f(n) = O(n); the author reports the three standard axioms; not built by the corpus, so claimed.
Linked from (1)
Graph