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:
Result history
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 details
Exact provenance
- Problem row
- sha256:c9c7ad5f977235848ba34e87285c05555de13792fe840a0231f5d6b5855efeda
- Metadata
- sha256:8ed400d17aa8e9321ca69429aade61a404ff741894fe641466af27bb45c77fa1
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:295a3ae9659a0eea4dfd92f79241669db5aed6f6b3c02def6efda6fd657e40fa
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207