It was proven by finding a set of 1476 reducible configurations by Appel and Haken, who then checked them all using a computer.
Paul Kainen suggested that this theorem could be related to quantum computing by applying it to a gedanken device consisting of two rooted cubic plane trees. A recent extension of this statement required the addition of the s-s-reflect extension to the Coq (cock) kernel. This theorem would follow from Wagner's theorem and the truth of the Hadwiger conjecture for K equals 5. A generalization of this statement says that the quantity in question is equal to the (*) floor of quantity 7 plus quantity square root one plus 48 times genus end quantity all over 2; that statement is named for Heawood. It was proven by finding a set of 1476 reducible configurations by Appel and Haken, who then checked them all using a computer. For 10 points, name this theorem which states that any given map can be filled in with only a limited number of hues.
Paul Kainen suggested that this theorem could be related to quantum computing by applying it to a gedanken device consisting of two rooted cubic plane trees.
four color theorem