A ramsey type problem concerning vertex colourings

Alon, 1985, Expanders, sorting in rounds and supencentrators of limited depth, 98 Alon, 1986, Eigenvalues, geometric expanders, sorting in rounds and Ramsey theory, Combinatorica, 6, 207, 10.1007/BF02579382 Beck, 1983, On size Ramsey numbers of paths, trees and circuits, I, J. Graph Theory, 7, 115, 10.1002/jgt.3190070115 Bollobás, 1985 Brown, 1987, A Theory of Generalized Graph Colourings Folkman, 1970, Graphs with monochromatic complete subgraphs in every edge coloring, SIAM J. Appl. Math., 18, 19, 10.1137/0118004 Frankl, 1988, The number of submatrices of a given type in a Hadamard matrix and related results, J. Combin. Theory Ser. B, 44, 317, 10.1016/0095-8956(88)90040-8 Friedman, 1987, Expanding graphs contain all small trees, Combinatorica, 7, 71, 10.1007/BF02579202 Harary, 1983, Generalized Ramsey theory for graphs. XIV. Induced Ramsey numbers, 90 Kierstead, 1987, A Ramsey theoretic problem for finite ordered sets, Discrete Math., 63, 217, 10.1016/0012-365X(87)90009-4 Nešetřil, 1978, Selective graphs and hypergraphs, 3, 181 V. Rödl, Selective graphs, manuscript. V. Rödl and E. Szemerédi, manuscript.