On restricted colourings ofK n

Given a sample graphH and two integers,n andr, we colourK _n byr colours and are interested in the following problem. Which colourings of the subgraphs isomorphic to H in K _n must always occur (and which types of colourings can occur whenK _n is coloured in an appropriate way)? These types of problems include theRamsey theory, where we ask: for whichn andr must a monochromaticH occur. They also include theanti-Ramsey type problems, where we are trying to ensure a totally multicoloured copy ofH, that is, anH each edge of which has different colour.