1. Larson J.A.: Ramsey theory for countable binary homogeneous structures. Notre Dame J. Formal Logic 46(3), 335–352 (2005)
2. Džamonja, M., Larson, J.A., Mitchell, W.J.: A partition theorem for a large dense linear order. Israel J. Math. (to appear)
3. Laflamme C., Sauer N.W., Vuksanovic V.: Canonical partitions of universal structures. Combinatorica 26(2), 183–205 (2006)
4. Erdős, P., Hajnal, A., Pósa, L.: Strong embeddings of graphs into colored graphs. In: Infinite and Finite Sets, vol. I (Colloq.,Keszthely, 1973; dedicated to P. Erdős on his 60th birthday),ColloquiaMathematica Societatis Janós Bolyai, 10, pp. 585–595. North-Holland, Amsterdam (1975)
5. Shelah, S.: Strong partition relations below the power set: consistency—was Sierpinski right? II. In: Sets, Graphs and Numbers (Budapest, 1991), Colloq. Math. Soc. János Bolyai, 60, pp. 637–688. North- Holland, Amsterdam (1991) Sh: 288