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_984ea4bfec53b5cf"}
- id
- vea_ba0fe2c0f179eecf
- frontier
- Erdős problems frontier
- source
- vs_33656c606f18aa86
- finding
- vf_b2be5ad20671687c
finding binding
boundtheoretical
Erdős Problem #965 has been DISPROVED (a counterexample is known). Statement: Erdős asks in [Er75b] if for every 2-coloring of ℝ, there is an uncountable set $A ⊆ ℝ$ such that all sums $a + b$ for $a, b ∈ A, a ≠ b$ have the same colour. In [Ko16] Péter Komjáth constructed a counterexample. The same result was proven independently in [SWCol] by Sokoup and Weiss. Topics: ramsey theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_984ea4bfec53b5cf
vs_33656c606f18aa86
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_984ea4bfec53b5cf"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_c7e998b6755ae445
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_0cdde50fe578ae5dfinding.assertedCandidate claim vc_984ea4bfec53b5cf imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_b0b112a2125b9d21finding.addCandidate claim vc_984ea4bfec53b5cf imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.