Skip to content

Erdős problem 965

Erdős asks in [Er75b] if for every 2-coloring of ℝ, there is an uncountable set A⊆RA ⊆ ℝ such that all sums a+ba + b for a,b∈A,a≠ba, b ∈ A, a ≠ b have the same colour.

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:a2ac79b8ad18f3e95c2795be876fbc885d31fe4fc580afa0a3bec05ed84faa68
Metadata
sha256:e586d60a42dd7d60ca844e8cd0508b4909bec387006971dcfdc177f107debc8d
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:85b71ddc4580f9e444f6456da3b942a52dc2b6d20e325eb07dfee74c73666b14
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page