Remove the Introduction and Strategy sections and everything after the
separating-cycle definition (no-separating-triangle lemma, 5-connectivity
proposition, and the Step 2-6 stubs). Rename the section heading from
"Step 1: The minimal counterexample" to "The minimal counterexample", drop
the now-unused separating-cycle definition, and adjust the lead-in to mention
only the degree reduction. Remaining: reduction-to-triangulations lemma,
minimal-counterexample definition, |V|>=12 remark, and minimum-degree-5 lemma.
Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
New paper "Dual Decomposition of Minimal Counterexamples" outlining a six-step
cut-and-recombine attack on the 4CT via the dual cubic graph: minimal
counterexample -> dualise -> minimum (cyclic) edge cut -> cap to cubic ->
3-edge-colour the pieces -> reconnect. Strategy section flags steps 1-5 as
standard machinery and step 6 (recombination) as the crux.
Step 1 written in full: reduction to triangulations, definition of the minimal
counterexample, minimum-degree >= 5 (degree <=3 and degree-4 Kempe cases), and
no separating triangle => 4-connected. 5-connectivity stated as Birkhoff's
separating-4-cycle reduction (attributed, not re-derived).
Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
didericis