Is Hadwiger's conjecture true?
13
Ṁ1kṀ3.3kresolved Oct 16
Resolved
NO1H
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,000🏅 Top traders
| # | Trader | Total profit |
|---|---|---|
| 1 | Ṁ890 | |
| 2 | Ṁ50 | |
| 3 | Ṁ9 | |
| 4 | Ṁ5 | |
| 5 | Ṁ0 |
Sort by:
So OpenAI just released a paper proof of a counterexample. Is there a Lean proof too?
@ScottW Okay, looking at the definition of "not_hadwiger_conjecture", "hadwigerNumber" and "HasCliqueMinor" the definitions seem correct. So I'll resolve this one as NO.
People are also trading
Related questions
Is the Hadamard conjecture true?
86% chance
Is Haborth's Conjecture true?
67% chance
Is the Hodge conjecture true?
45% chance
Is Dickson's conjecture true?
92% chance
Is Goodman's Conjecture true?
71% chance
Is Beal's conjecture true?
53% 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