Skip to content

Erdős problem 965

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

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#965
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page