Heawood conjecture

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Etymology[edit]

Formulated in 1890 by Percy John Heawood.

Proper noun[edit]

the Heawood conjecture

  1. (graph theory) A conjecture (proven in 1968) that gives a lower bound for the number of colors that are necessary for graph coloring on a surface of a given genus.

Related terms[edit]

See also[edit]

Retrieved from "https://en.wiktionary.org/w/index.php?title=Heawood_conjecture&oldid=77952005"