---

Statement

Problem 2 (printed p. 223), quoted: "Is it true that if $\alpha\to(\alpha,3)^2_2$ then also $\alpha\to(\alpha,n)^2_2$?"

The print does not say what kind of object $\alpha$ is; Problem 1, just before it, concerns ordinals. It states no range for $n$, and gives no proof or partial result.

Source. P. Erdős, Some problems on finite and infinite graphs, Logic and Combinatorics (Arcata, Calif., 1985), Contemp. Math. 65, Amer. Math. Soc. (1987), 223--228; Problem 2, p. 223, PDF p. 1 of the Rényi archive's scan (printed p. $n$ = PDF p. $n-222$), read on the rendered page image. The edition read is identified in the source digest.

Read depth. Claims checked: the question was read on the page image. A question has no proof to check.

Proof pointer

None in the source.

Dependencies

None.

Bears on

• Problem 118: the question is this problem's, which the site states for every $n\ge3$ and for $\alpha$ a cardinal, ordinal or order type; the print leaves $\alpha$ and $n$ unqualified. The paper poses it and records no result on it.