A Short Note on a Possible Proof of the Four-colour Theorem
Maria Isabel Marques Ribeiro · International Journal of Pure and Apllied Mathematics · 2017
In this note, we study a possible proof of the Four-colour Theorem, which is the proof contained in (Potapov, 2016), since it is claimed that they prove the equivalent for three colours, and if you can colour a map with three colours, then you can colour it with four, like three starts being the new minimum. We get to prove that this interesting proof, made of terms such as NP-complete, 3-SAT, certificate, hardness, satisfiable, and certifier is at most an attempt to have a proof, and an exotic one, since all that is involved is very different from what we expect to see in a proof of this type.