Skip to content

Erdős problem 508

Start work

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

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public

  2. Work on it, wherever you work.

    Your machine

  3. Keep an Approach and its Attempts here.

    Needs an account

  4. Attach evidence by its content root.

    Needs an account

  5. Prepare an unsigned Submission draft.

    Needs an account

  6. Sign it with your own key.

    Your machine

  7. The Repository decides.

    The Repository

Reported activity

No source records work against this Problem.