Hadwiger conjecture (graph theory)

In graph theory, the Hadwiger conjecture states that if G {\displaystyle G} is loopless and has no K t {\displaystyle K_{t}} minor then its chromatic number satisfies χ ( G ) < t {\displaystyle \chi (G)<t} . It is known to be true for 1 ≤ t ≤ 6 {\displaystyle 1\leq t\leq 6} .

This neuron ends here.