Word.ws English Dictionary

Heawood conjecture

Heawood conjecture proper noun: 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.

Proper noun

the Heawood conjecture

  1. 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.

Origin of Heawood conjecture

Formulated in 1890 by Percy John Heawood.

Questions about Heawood conjecture

What does Heawood conjecture mean?
Heawood conjecture means 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.
What part of speech is Heawood conjecture?
Heawood conjecture is a proper noun.

Words near Heawood conjecture in the dictionary

  1. heavywater
  2. heavyweight
  3. heavyweight spaceship
  4. heavyweights
  5. Heawood
  6. Heawood conjecture
  7. Heawood graph
  8. Heawood graphs
  9. Heawoods
  10. heazlewoodite
  11. Heb.

Source and license

Adapted from Wiktionary: Heawood conjecture (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Heawood conjecture.” Word.ws, https://word.ws/heawood_conjecture. Based on Wiktionary, CC BY-SA 4.0.