Suppose that is a matrix of integers such that fir any there is some such that any -colouring of contains a monochromatic solution to , meaning there is a colour class and such that . Not all matrices have this property (consider, for example, when all the entries of are positive), but when they do they are called partition regular. In this talk we consider what bounds can be given on in terms of (and ) when is partition regular.