Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1983_03_01_thomassen: Thomassen (Combinatorica 1983) proves that a graph of uncountable chromatic number has an edge lying on a cycle of every sufficiently large length; accepted on the refereed publication and the site's credit.
Linked from (1)
Graph