Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2012_08_16_fox_loh_zhao: Theorem 1.10 of Fox, Loh and Zhao (Combinatorica 2015): RT(n, K_4, m) is at least (1/8 − o(1)) n² when m = n e^{−f(n)}, f(n) = o((log n/log log n)^{1/2}), a range containing n/log n, so the answer to Problem 615 is no; refereed.
Linked from (1)
Graph