Roberson, Sanders, Seymour, and Thomas proved this statement by showing that every snark has the Petersen graph as a minor.
Roberson, Sanders, Seymour, and Thomas proved this statement by showing that every snark has the Petersen graph as a minor. This was first proposed by Francis Guthrie in 1852, and Kempe and Tait's purported proofs for this were later shown to be incorrect after being unchallenged for eleven years. Appel and Haken's proof of this theorem involved 1936 configurations. This was the first major theorem to be proved using a computer. Name this theorem which states that no more than the eponymous number of colors is needed to color a map so no adjacent regions are the same color.
Roberson, Sanders, Seymour, and Thomas proved this statement by showing that every snark has the Petersen graph as a minor.
{Four-Color} Map {Theorem}