Erdős problem 508
This upper bound for the chromatic number of the plane was observed by John R. Isbell. His approach was dividing the plane into hexagons of uniform size and coloring them with a repeating pattern. A proof can probably be found in:
Nothing has been recorded here yet.
How far the record reaches3 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal5 retained
- ResolutionNone filed
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingResolution
No source retained here records an outcome for this question.
Its collection still marks it open.
Where the source files it217 share a topic
Erdős problem 94acceptedCarrying a Standing. Browse the topic.