Heawood conjecture

English

Etymology

Formulated in 1890 by Percy John Heawood.

Proper noun

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.
  • Heawood number

See also

  • Ringel-Youngs theorem
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.