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:
- Formal statements
- 1 open · 2 solved · 2 textbook
- Erdős Problems says
- open
- Decision here
- No current contribution
- Checks
- 0 checks · 5 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained