Erdős Problem 590

References:

• erdosproblems.com/591
• [Ch72] Chang, C. C., A partition theorem for the complete graph on {$\omega\sp{\omega }$}. J. Combinatorial Theory Ser. A (1972), 396-452.
• [Sp57] Specker, Ernst, Teilmengen von Mengen mit Relationen. Comment. Math. Helv. (1957), 302-314.
• [La73] Larson, Jean A., A short proof of a partition theorem for the ordinal {$\omega \sp{\omega }$}. Ann. Math. Logic (1973/74), 129-145.

theorem erdos_590 : OmegaPowerRamsey Ordinal.omega0 3

Let $α$ be the infinite ordinal $\omega^{\omega}$. It was proved by Chang [Ch72] that any red/blue colouring of the edges of $K_α$ there is either a red $K_α$ or a blue $K_3$.

theorem erdos_590.variants.two : OmegaPowerRamsey 2 3

Specker [Sp57] proved that when $α=ω^2$ any red/blue colouring of the edges of $K_α$ there is either a red $K_α$ or a blue $K_3$.

theorem erdos_590.variants.ge_three_false (n : ℕ) (h : 3 ≤ n) : ¬OmegaPowerRamsey (↑n) 3

Specker [Sp57] proved that when $α=ω^n$ for $3≤ n < \omega$ then it is not the case that any red/blue colouring of the edges of $K_α$ there is either a red $K_α$ or a blue $K_3$.

theorem erdos_590.variants.finite_cardinal (m : ℕ) : OmegaPowerRamsey Ordinal.omega0 ↑m

Let m be a finite cardinal $< \omega$. Let $α$ be the infinite ordinal $\omega^{\omega}$. It was proved by Milnor that any red/blue colouring of the edges of $K_α$ there is either a red $K_α$ or a blue $K_3$. A shorter proof was found by Larson [La73]