Is Hadwiger's conjecture true?
10
1kṀ1782100
58%
chance
1H
6H
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 to start trading!
1,000People are also trading
Related questions
Is the Hodge conjecture true?
80% chance
Is Haborth's Conjecture true?
70% chance
Is the Unique Games Conjecture true?
65% chance
Is Legendre's conjecture correct?
87% chance
Is the Hadamard conjecture true?
84% chance
Is Dickson's conjecture true?
92% chance
Is the second Hardy-Littlewood conjecture true?
7% chance
Is Schanuel's conjecture true?
77% chance
Is Goodman's Conjecture true?
71% chance
Is Beal's conjecture true?
59% chance