Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2025_09_22_cambie_chan_hunter: A construction posted to the site's forum in September 2025: four joined copies of one random graph with (3/4 − o(1))n distinct degrees and trivial subgraphs of O(log n) vertices; the site records it as the disproof.
Linked from (1)
Graph