Is Hadwiger's conjecture true?

10

แน1782100

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?

Get

1,000

and1.00

## Related questions

## Related questions

Is Haborth's Conjecture true?

70% chance

Is the Hadamard conjecture true?

84% chance

Is the Hodge conjecture true?

80% chance

Is Beal's conjecture true?

60% chance

Is Goodman's Conjecture true?

71% chance

Is Schanuel's conjecture true?

78% chance

Is Rudin's conjecture true?

69% chance

Is Szymanski's conjecture true?

81% chance

Is the strong Rudin's conjecture true?

64% chance

Is the Jacobian conjecture true?

76% chance