Erdős problem 965
Erdős asks in [Er75b] if for every 2-coloring of ℝ, there is an uncountable set such that all sums for have the same colour.
Erdős Problems records this as disproved.
No Repository has ruled on it here.
How far the record reaches4 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal2 retained
- Resolutiondisproved
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingWork
Nothing here has checked that finding.
Reproducing it here turns a report into evidence.
Where the source files it113 share a topic
None carries a Standing. Browse the topic.