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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper nounthe Heawood conjecture
  1. graph theoryA 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

Formulated in 1890 by Percy John Heawood.

Full word history & related roots →
Cite this entry
APA

Heawood conjecture. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Heawood%20conjecture

MLA

“Heawood conjecture.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Heawood%20conjecture. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Heawood conjecture,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Heawood%20conjecture.

Source: Heawood conjecture on Wiktionary, CC BY-SA 4.0.