Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2009_01_25_conlon_fox_sudakov: Every two-coloring of the triples of an n-set has a set of c sqrt(log n) points with all but an epsilon fraction of its triples in one color, and a random coloring makes this tight; so for t = 3 no jump occurs inside (0, 1/2).
Linked from (1)
Graph