Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2003_01_01_hajnal_komjath: The site credits Hajnal and Komjáth (Combinatorica, 2003) with the consistency that every aleph_1-chromatic graph has an edge coloring with aleph_1 colors in which every countable vertex partition has a class with edges of all colors.
Linked from (1)
Graph