Re:A Non-Constructive Proof of the Four Colour Theorem
by kazinator on Wednesday December 21, 2022 @09:39PM
(#34089034)
An inductive hypothesis mentioning some independent variable like n needs to look like a conditional, e.g.: "If all maps in Q with at most n-1 edges are 4-colorable, then all maps with at most Q(n) is 4-colored, all maps in Q with at most n edges can be 4-colored" and then it has to be shown.
[ Parent
| on HN ]
There are no comments on this comment yet.