Is Hadwiger's conjecture true? | Manifold

Is Hadwiger's conjecture true?

Plus

10

Ṁ178

2100

58%

chance

1D

1W

1M

ALL

Hadwiger's conjecture states that if a graph G does not contain the complete graph on k vertices as a minor, then the chromatic number of G is less than k. Is it true?

This question is managed and resolved by Manifold.

Get

1,000

and

3.00

Related questions

Is Haborth's Conjecture true?

Is the Hodge conjecture true?

Is Goodman's Conjecture true?

Is Rudin's conjecture true?

Is the Jacobian conjecture true?

Is the Hadamard conjecture true?

Is Beal's conjecture true?

Is Schanuel's conjecture true?

Is Szymanski's conjecture true?

Conditional on Goldbach's conjecture being false, is Oldbach's conjecture true?

Related questions

Is Haborth's Conjecture true?

Is the Hadamard conjecture true?

Is the Hodge conjecture true?

Is Beal's conjecture true?

Is Goodman's Conjecture true?

Is Schanuel's conjecture true?

Is Rudin's conjecture true?

Is Szymanski's conjecture true?

Is the Jacobian conjecture true?

Conditional on Goldbach's conjecture being false, is Oldbach's conjecture true?

© Manifold Markets, Inc.•Terms + Mana-only Terms•Privacy•Rules