3 ms·
This is a common mis-conception, but the answer is no. The 1976 Haken-Appel proof of the 4CC, now 4CT, proved that provided there was a collection of graphs th
by ColinWright 7y ago
This is a common mis-conception, but the answer is no.
The 1976 Haken-Appel proof of the 4CC, now 4CT, proved that provided there was a collection of graphs that satisfied a certain criterion, the conjecture was true. In essence, they need a collection such that every graph had one (or more) of them as a sub-graph (the collection is unavoidable), and such that each of them was "reducible".
Finding such a collection was tedious and error-prone, and then checking that each had the required property was also tedious and error-prone, so they programmed computers to construct the collection and verify the properties.
The computer did not prove anything, and the structure of the proof is fairly easy to understand.