For graphs F, G and H, let F -> (G, H) signify that any red/blue edge coloring of F contains either a red G or a blue H. The Ramsey number R(G, H) is defined as the minimum r such that K-r -> (G,H), and the star-critical Ramsey number R-S(G,H) is defined as the maximum n such that K-r \ K-1,K-n -> (G,H), where r = R(G,H). We shall determine R-S(K-2 +G,K-1 + nH) to be v(H)n - delta(H)-1 for all large n.