By an r-graph, we mean a finite set V of elements called vertices and a collection of some of the r-subsets of V called edges with the property that each vertex is incident with at least one edge. An A-chromatic r-graph is an r-graph all of whose edges are coloured A.Theorem. Let G1, …, Gt denote r-graphs. There exists a nonempty class of r-graphs such that for each if the edges of G are painted arbitrarily in t colours A1, …, At, then for at least one i in {1, …, t}, G has an Ai-chromatic r-subgraph which is isomorphic to Gi.