Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1986_01_01_phelps_rodl: Phelps and Rödl (1986) determine the order of the largest independent set guaranteed in every 3-uniform linear hypergraph on n vertices as the square root of n log n; refereed in Ars Combinatoria and credited by the curator.
Linked from (1)
Graph