Generalised Ramsey numbers with respect to classes of graphs

Let H-1, ..., H-t be classes of graphs. The class Ramsey number R(H-1 ,...,H-t) is the smallest integer n such that for each t-edge colouring (G(1), ..., G(t)) of K-n, there is at least one i is an element of {1, ..., t} such that Gi contains a subgraph H-i is an element of H-i. We take t = 2 and determine R(G(l)(1), G(m)(1)) for all 2 less than or equal to l less than or equal to m and R(G(l)(2), G(m)(2)) for all 3 less than or equal to l less than or equal to m, where G(j)(i) consists of all edge-minimal graphs of order j and minimum degree i.