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

    [edit]
    0 references
    [add]
    /m/05l6s0
    [edit]
    1 reference
    [add]
    Language Code Linked page
    Deutsch dewiki
    English enwiki
    français frwiki
    русский ruwiki
    українська ukwiki
    [add]
    [add]
    [add]
    [add]
    [add]
    [add]