Heawood conjecture
= Heawood conjecture
{wiki=Heawood_conjecture}
The Heawood conjecture is a statement in the field of graph theory that relates to the coloring of surfaces. Specifically, it concerns the minimum number of colors required to color the edges of a surface so that no two edges that meet at a vertex share the same color.