Chang, C. C., A partition theorem for the complete graph on ω\spω. J. Combinatorial Theory Ser. A 12 (1972), 396--452; doi:10.1016/0097-3165(72)90105-7 (received 24 February 1970; the running head prints volume 12). The Theorem ωω→(ωω,3)2 with its explanation and its attribution to Problem 7 of the Erdős--Hajnal list, p. 396; the four lemmas and the proof of the theorem from them, pp. 403--405; footnote 1 with Milner's ωω→(ωω,m)2, m<ω, and Larson's shorter proof [La73], p. 397; the Theorem, the lemma statements and the reduction are the basis at statement depth, the proofs of the lemmas for structure only. Library home: Chang 1972 and its Chang 1972, Theorem (p. 396) page.