Q1128435

From Wikidata
Jump to: navigation, search

Hadwiger conjecture (Q1128435)[edit]

conjecture that all graphs requiring k or more colors contain a k-vertex complete minor [edit]

No aliases defined. [add]

Statements

/m/05l6s0
[edit]
1 reference
[add]