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 Ṁ200 play money
More related questions
Related questions
Is Haborth's Conjecture true?
70% chance
Is the Jacobian conjecture true?
76% chance
Is Rudin's conjecture true?
69% chance
Is Carmichael's totient conjecture true?
83% chance
Is the four exponentials conjecture true?
85% chance
Is the strong Rudin's conjecture true?
64% chance
Is Goodman's Conjecture true?
71% chance
Is Schanuel's conjecture true?
78% chance
Is de Polignac's conjecture true?
87% chance
Is the Hadamard conjecture true?
84% chance