Claims

../

1986_12_01_erdos_frankl_rodl: Theorem 1.7 of Erdős, Frankl and Rödl (Graphs Combin. 1986) proves g_n(3r-3,3,r) = o(n^2) for every r >= 3, so with the Brown-Erdős-Sós lower bound d_r(3) = 3r-3; accepted on the refereed publication.

2004_12_01_sarkozy_selkow: Sárközy and Selkow (Combinatorica 2005) prove d_r(e) <= (r-2)e + 2 + floor(log_2 e) for all r, e >= 3, which meets the conjectured value at e = 3; accepted on the refereed publication.

---