Heawood conjecture

短语

词形变化

the Heawood conjecture

释义与例句

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

    数学

词源

Formulated in 1890 by Percy John Heawood.

来源：wiktionary