Hadwiger conjecture (graph theory)
id:
hadwiger-conjecture-graph-theory-278-939198
title:
Hadwiger conjecture (graph theory)
text:
In graph theory, the Hadwiger conjecture states that if G is loopless and has no K t minor then its chromatic number satisfies χ < t . It is known to be true for 1 ≤ t ≤ 6 . The conjecture is a generalization of the four-color theorem and is considered to be one of the most important and challenging open problems in the field. In more detail, if all proper colorings of an undirected graph G use k or more colors, then one can find k disjoint connected subgraphs of G such that each subgraph is con
brand slug:
wiki
category slug:
encyclopedia
description:
Unproven generalization of the four-color theorem
original url:
https://en.wikipedia.org/wiki/Hadwiger_conjecture_(graph_theory)
date created:
date modified:
2024-03-27T20:54:53Z
main entity:
{"identifier":"Q1128435","url":"https://www.wikidata.org/entity/Q1128435"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/0c/Hadwiger_conjecture.svg","width":630,"height":630}
fields total:
13
integrity:
15