From the text: ”J. Folkman [SIAM J. Appl. Math. 18, 19-24 (1970; Zbl 0193.531)] proved the following statement: To every finite graph G and every positive integer r there exists a graph H with \(cl(H)=cl(G)\) and such that whenever the set of vertices is partitioned into r classes \(C_ 1,C_ 2,...,C_ r\) then there exists \(i\leq r\) and some vertices in \(C_ i\) spanning a subgraph isomorphic to G. Here we consider two different extensions of Folkman’s result, both to infinite graphs. First we show that Folkman’s result remains valid if either r or cl(G) are finite. The second generalization concerns universal graphs: Let \(V_ k\) be a universal countable \(K_ k\)-free graph. Answering a question of A. Hajnal we show that for any coloring of the points of the countably universal triangle free graph \(V_ 3\) by finitely many colors we can always find a monochromatic copy of \(V_ 3\). We conjecture that the statement remains valid for \(k>3.''\)