erdős #592
Determine which countable ordinals have the property that, if , then in any red/blue colouring of the edges of there is either a red or a blue .
Worked, still open.
set theory · open · prize $1000 · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Write the statement in arrow notation as [ \omega^\beta \to (\omega^\beta,3)^2, ] i.e. every red/blue colouring of ([\omega^\beta]^2) yields either a red-homogeneous set of order type (\omega^\beta) [[nomath]](a red $K_{\omega^\beta}$)[[/nomath]] or a blue-homogeneous set of size $3$ (a blue triangle).
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 3 · open (literature)
theorem erdos_592 (β : Ordinal.{u}) : β.card ≤ ℵ₀ →
OrdinalCardinalRamsey (ω ^ β) (ω ^ β) 3 ↔ (answer(sorry) : Ordinal.{u} → Prop) βformal-conjectures/592.lean ↗status
open