erdős #591
Let be the infinite ordinal . Is it true that in any red/blue colouring of the edges of there is either a red or a blue ?
Worked, still open.
set theory · solved · prize $250 · 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
Yes — in the usual *ordinal* sense of “(K_\alpha)” [[nomath]](i.e., vertices are $\alpha$ with its well-order, and a “$K_\alpha$” subgraph means a subset of vertices of **order type $\alpha$** whose induced edges are monochromatic)[[/nomath]].
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 3 · solved (literature)
theorem erdos_591 : answer(True) ↔ OrdinalCardinalRamsey (ω ^ ω ^ 2) (ω ^ ω ^ 2) 3formal-conjectures/591.lean ↗
status
solved