Is Hadwiger's conjecture true?
Plus
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 play money
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 Dickson's conjecture true?
92% chance
Is Goodman's Conjecture true?
71% chance
Is Beal's conjecture true?
59% chance
Is the second Hardy-Littlewood conjecture true?
7% chance
Is Legendre's conjecture correct?
87% chance
Is Schanuel's conjecture true?
77% chance
Is Agrawal's conjecture true?
34% chance