3 ms·
"famously, the four color theorem was proved by computers through exhaustive analysis (checking every possibility)" This is impossible. The plane can be arbit
by acchow 5y ago
"famously, the four color theorem was proved by computers through exhaustive analysis (checking every possibility)"
This is impossible. The plane can be arbitrarily large with an arbitrary number of regions. It can be exhaustively checked for n number of regions up to a certain n. But not for arbitrary n.
- HelloNurse 5y agoNot every possible graph, just every "interesting" class of subgraph that can be extended or combined with others to obtain a coloring of any planar graph. These are a large but finite number; if a graph is planar it cannot have too many edges.