Erdős problem 590 · problems.science

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$ .

Sources

Browse retained paths and inspect the exact material available for this Problem.

4 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

590.lean

Retained formal statement3 of 4

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$ .

FormalConjectures/ErdosProblems/590.leanErdos590.erdos_590.variants.ge_three_false1 lineExact file

1∀ {n : ℕ}, 3 ≤ n → ¬OrdinalCardinalRamsey (Ordinal.omega0 ^ n) (Ordinal.omega0 ^ n) 3

SolvedStatement only, no proof

Sources

Search problems.science