evidence boundary
supportsfrontiers / frontier
Erdős problems frontier
- id
- vfr_37aec80d874a0239
- license
- CC-BY-4.0
- findings
- 1,256
- accepted core
- 6
- contested
- 0
- links
- 17
- sources
- 1,234
- evidence
- 1,256
- avg conf
- 0.98
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_1e6b6df0cd879f0c"}
- id
- vea_71ebfb1b69d7df23
- frontier
- Erdős problems frontier
- source
- vs_aa92eab52f82fb15
- finding
- vf_488d07d058d4ffe9
finding binding
boundtheoretical
Erdős Problem #590 has been PROVED (Erdős's conjecture holds). Statement: 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$. Topics: set theory, ramsey theory. Erdős prize: $250. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_1e6b6df0cd879f0c
vs_aa92eab52f82fb15
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_1e6b6df0cd879f0c"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_7bd64b9ca634bca3
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_15c9d2da5e00d947finding.assertedCandidate claim vc_1e6b6df0cd879f0c imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_00ac9cb8f3299ee7finding.addCandidate claim vc_1e6b6df0cd879f0c imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.