This article is not yet available in English; the French version is shown.
Articles recommended for you.
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.
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 32nd Mathematical and Logical Games Championship, organized by the Fédération française des jeux mathématiques, is under way. Tangente brings you an exclusive look at the eighteen problems from the individual quarterfinals.
What do links and planar graphs have in common? They are connected by a relationship that associates a graph with any given link and, conversely, provides a simple way to encode—and therefore draw—any link using a graph.
