Skip to content

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:

Workspace

Continue locallyOpen sourceSign in to contribute

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#508
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page