In 2000, an Indian used Eilenberg modules and Hall matchings to prove this statement, which degenerates into the Hadwiger Conjecture when n=5.
In 2000, an Indian used Eilenberg modules and Hall matchings to prove this statement, which degenerates into the Hadwiger Conjecture when n=5. Perhaps first proposed by Francis Guthrie, who lends it an alternate name, this problem was thought to be proven by the Kempe algorithm. Though it was solved by Appel and Haken in 1976 using computer-generated configurations, it turns out this theorem can be considered a special case of the Heawood conjecture, which assigns a topological space an upper limit on chromatic numbers. For 10 points, name this theorem, which states that a map may be filled with a certain number of colors so that adjacent regions are different colors.
In 2000, an Indian used Eilenberg modules and Hall matchings to prove this statement, which degenerates into the Hadwiger Conjecture when n=5.
{Four Color} Map Theorem [accept {Guthrie's conjecture} until mentioned]