Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1988_02_01_foreman_laver: Foreman and Laver (Adv. Math., 1988) build from a huge cardinal a model of ZFC and GCH in which every graph of size and chromatic number has a subgraph of size and chromatic number , so no graph answers the first question positively there.
Linked from (1)
Graph