Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1970_01_01_folkman: Folkman (1970) proves that a graph in which every subgraph on n vertices has an independent set of size at least (n minus k)/2 has chromatic number at most k plus 2, answering the question of Erdős and Hajnal for every k.
Linked from (1)
Graph