1. Denis C. Devlin: Some partition theorems and ultrafilters on ω, Ph.D. thesis, Dartmouth College, 1979.
2. Paul Erdős, András Hajnal and Lajos Pósa: Strong embeddings of graphs into colored graphs, Colloquia Mathematica Societatis János Bolyai, 10, Vol. I, Infinite and Finite Sets, 585–595.
3. Paul Erdős and Richard Rado: A combinatorial theorem, J. London Math. Soc. 25(2) (1950), 249–255.
4. Ronald L. Graham, Donald K. Knuth and Oren Patashnik: Concrete Mathematics, Addison-Wesley Publishing Company, New York, 1989.
5. Claude Laflamme, Norbert W. Sauer and Vojkan Vuksanovic: Canonical partitions of universal structures, Combinatorica 26(2) (2006), 183–205.