Claims

../

2005_03_01_alon_rodl: Alon and Rödl's Theorem 3.2 (Combinatorica 2005, refereed): the construction inside its proof gives graphs not Ramsey for a triangle whose independence number is a polylogarithm times the cube root of n, so the answer is no.

---