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 ?

claimed — no verifier run, no signed judgmentunreviewedOpen. Worked here; no verified result yet.

set theory · solved · prize $250 · formalized (Lean) · 0 attempts

use this data

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

Evidence

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 proof

AMS 3 · solved (literature)

theorem erdos_591 : answer(True) ↔ OrdinalCardinalRamsey (ω ^ ω ^ 2) (ω ^ ω ^ 2) 3
formal-conjectures/591.lean ↗

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Verify this yourself

Run this command — the output must match these fingerprints.

vela reproduce examples/erdos-problems
  • packet.json · sha256 f2d357ab8f895903dc8bef87d8b192fcaf1da83b569ade239ca3173f7bfc0c9f

Search Vela

Search problems, results, contributors, and pages — or jump straight to an id.