

In 1950, American mathematician Edward Nelson (1932–2014) proposed an entertaining coloring problem.



Articles recommended for you.

Coloring problems are often very simple to state and may appeal to many amateur mathematicians. Unfortunately—or perhaps fortunately?—they conceal deep difficulties that continue to tax the mathematical community. A new breakthrough was made recently.

For plane coloring, we already knew that four colors were enough to color any map so that no two neighboring countries ever had the same color.

The proof of the four-color theorem caused quite a stir! Results on colorings using only two or three colors have proved less controversial. By considering how to make a beaded necklace, we can take a fresh look at these coloring questions.

On a sheet of paper, you doodle a few points, join them with lines... and you're off! Trial and error, attempts, mistakes, partial successes, a conjecture... It's all there. Mathematics—graph theory in particular—joins the party.
Discussion
Sign in to post a comment and talk with other readers.
No comments yet. Be the first to respond.