didericis/math-research
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

dual_decomposition: trim to the minimal-counterexample section

Browse Source 
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>
This commit is contained in:
didericis
2026-05-22 18:28:32 -04:00
parent b2eb7ef3cb
commit bd8526eb11
6 changed files with 34 additions and 171 deletions
Download Patch File Download Diff File Expand all files Collapse all files
papers/dual_decomposition_minimal_counterexamples/paper.aux
+5 -14
View File
@@ -1,20 +1,11 @@
\relax
\@writefile{toc}{\contentsline {section}{\tocsection {}{1}{Introduction}}{1}{}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\tocsection {}{2}{Strategy}}{1}{}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\tocsection {}{3}{Step 1: The minimal counterexample}}{2}{}\protected@file@percent }
\newlabel{lem:triangulate}{{3.1}{2}}
\newlabel{def:minimal}{{3.2}{2}}
\newlabel{lem:mindeg}{{3.4}{2}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{1}{The minimal counterexample}}{1}{}\protected@file@percent }
\newlabel{lem:triangulate}{{1.1}{1}}
\newlabel{def:minimal}{{1.2}{1}}
\newlabel{lem:mindeg}{{1.4}{1}}
\newlabel{tocindent-1}{0pt}
\newlabel{tocindent0}{0pt}
\newlabel{tocindent1}{17.77782pt}
\newlabel{tocindent2}{0pt}
\newlabel{tocindent3}{0pt}
\newlabel{lem:no-sep-tri}{{3.6}{3}}
\newlabel{prop:5conn}{{3.7}{3}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{4}{Step 2: The dual cubic graph}}{3}{}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\tocsection {}{5}{Step 3: The minimum edge cut}}{3}{}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\tocsection {}{6}{Step 4: Capping to cubic planar graphs}}{3}{}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\tocsection {}{7}{Step 5: Colouring the pieces}}{3}{}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\tocsection {}{8}{Step 6: Reconnecting the colourings}}{3}{}\protected@file@percent }
\gdef \@abspage@last{3}
\gdef \@abspage@last{2}
papers/dual_decomposition_minimal_counterexamples/paper.fdb_latexmk
+3 -3
View File
@@ -1,5 +1,5 @@
# Fdb version 3
["pdflatex"] 1779486794 "paper.tex" "paper.pdf" "paper" 1779486794
["pdflatex"] 1779488879 "paper.tex" "paper.pdf" "paper" 1779488879
"/usr/local/texlive/2022/texmf-dist/fonts/map/fontname/texfonts.map" 1577235249 3524 cb3e574dea2d1052e39280babc910dc8 ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm" 1246382020 1004 54797486969f23fa377b128694d548df ""
"/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex8.tfm" 1246382020 988 bdf658c3bfc2d96d3c8b02cfc1c94c20 ""
@@ -54,8 +54,8 @@
"/usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map" 1647878959 4410336 7d30a02e9fa9a16d7d1f8d037ba69641 ""
"/usr/local/texlive/2022/texmf-var/web2c/pdftex/pdflatex.fmt" 1665017617 2826443 7e98410c533054b636c6470db83a27bc ""
"/usr/local/texlive/2022/texmf.cnf" 1647878952 577 209b46be99c9075fd74d4c0369380e8c ""
"paper.aux" 1779486794 1292 11fa10d77f13da04c6c3a1ad6651c1ea "pdflatex"
"paper.tex" 1779486789 9552 f87ebab3cd7cd6cdcfb13edd9d40fa72 ""
"paper.aux" 1779488879 395 3d9d6ecb308d4771fc574ef59dbc631f "pdflatex"
"paper.tex" 1779488875 3976 7b376fa4f80996836d72b6d62b391567 ""
(generated)
"paper.aux"
"paper.log"
papers/dual_decomposition_minimal_counterexamples/paper.fls
+1 -1
View File
@@ -219,12 +219,12 @@ INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmcsc10.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti8.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmbx10.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmcsc10.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti10.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam10.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam7.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm10.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm7.tfm
INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti10.tfm
OUTPUT paper.pdf
INPUT /usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map
INPUT paper.aux
papers/dual_decomposition_minimal_counterexamples/paper.log
+22 -22
View File
@@ -1,4 +1,4 @@
This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 22 MAY 2026 17:53
This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 22 MAY 2026 18:27
entering extended mode
restricted \write18 enabled.
%&-line parsing enabled.
@@ -192,31 +192,31 @@ File: epstopdf-sys.cfg 2010/07/13 v1.3 Configuration of (r)epstopdf for TeX Liv
e
))
[1{/usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map}]
[2] [3] (./paper.aux) )
[2] (./paper.aux) )
Here is how much of TeX's memory you used:
2985 strings out of 478268
41559 string characters out of 5846347
340100 words of memory out of 5000000
21035 multiletter control sequences out of 15000+600000
2983 strings out of 478268
41531 string characters out of 5846347
338080 words of memory out of 5000000
21033 multiletter control sequences out of 15000+600000
475666 words of font info for 53 fonts, out of 8000000 for 9000
1302 hyphenation exceptions out of 8191
69i,8n,76p,242b,282s stack positions out of 10000i,1000n,20000p,200000b,200000s
</usr/local/texlive/2022/texmf-dist/fonts/type1/public/a
msfonts/cm/cmbx10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/am
sfonts/cm/cmcsc10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/am
sfonts/cm/cmmi10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/ams
fonts/cm/cmr10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfo
nts/cm/cmr7.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts
/cm/cmr8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm
/cmsy10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/
cmsy7.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cm
ti10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmt
i8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/
msam10.pfb>
Output written on paper.pdf (3 pages, 159944 bytes).
69i,8n,76p,242b,225s stack positions out of 10000i,1000n,20000p,200000b,200000s
</usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfo
nts/cm/cmbx10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfon
ts/cm/cmcsc10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfon
ts/cm/cmmi10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfont
s/cm/cmr10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/
cm/cmr7.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/
cmr8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cms
y10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy
7.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti10
.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti8.p
fb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msam
10.pfb>
Output written on paper.pdf (2 pages, 142068 bytes).
PDF statistics:
69 PDF objects out of 1000 (max. 8388607)
41 compressed objects within 1 object stream
66 PDF objects out of 1000 (max. 8388607)
39 compressed objects within 1 object stream
0 named destinations out of 1000 (max. 500000)
1 words of extra memory for PDF output out of 10000 (max. 10000000)
papers/dual_decomposition_minimal_counterexamples/paper.pdf
BIN
View File
Binary file not shown.
papers/dual_decomposition_minimal_counterexamples/paper.tex
+3 -131
View File
@@ -48,66 +48,12 @@ graph, edge connectivity, cyclic edge cut, Tait colouring, $3$-edge-colouring}
\maketitle
\section{Introduction}
% TODO: introduction.
By Tait's theorem, a plane triangulation $G$ is properly $4$-vertex-colourable if
and only if its dual cubic graph $G'$ is properly $3$-edge-colourable. We propose
to obstruct a minimal counterexample to the Four Colour Theorem by decomposing its
dual along a minimum edge cut, $3$-edge-colouring the two resulting pieces, and
recombining the colourings.
\section{Strategy}
% Outline of the intended argument. Each step below is to be made precise and
% proved in its own section; nothing here is yet established.
The argument proceeds in six steps.
\begin{enumerate}
\item \textbf{Minimal counterexample.} Assume a smallest maximal planar graph
$G$ admitting no proper $4$-colouring. Standard reductions let us take $G$
to be $5$-connected, so its dual $G'$ is a cyclically $5$-edge-connected
cubic plane graph.
\item \textbf{Dualise.} Pass to the dual cubic plane graph $G'$, where, by
Tait, $4$-colourability of $G$ is equivalent to $3$-edge-colourability of
$G'$.
\item \textbf{Minimum edge cut.} Take a smallest edge cut of $G'$ separating it
into two components $A$ and $B$. (The size of the smallest cyclic edge cut
equals the cyclic edge connectivity of $G'$; record which cut is used and
why it is minimal.)
\item \textbf{Cap to cubic.} Add the minimum number of edges (and, if needed,
vertices) to each of $A$ and $B$ to absorb the severed cut edges, yielding
two cubic plane graphs $A^{+}$ and $B^{+}$, each smaller than $G'$.
\item \textbf{Colour the pieces.} Since $A^{+}$ and $B^{+}$ are smaller than the
minimal counterexample's dual, each admits a proper $3$-edge-colouring.
\item \textbf{Reconnect.} Prove that the two $3$-edge-colourings can be made
compatible across the cut --- after a colour permutation and Kempe-type
adjustments --- so that they glue to a proper $3$-edge-colouring of $G'$,
contradicting the assumption that $G$ is a counterexample.
\end{enumerate}
\begin{remark}
Steps (1)--(5) are assembled from standard machinery (minimality, Tait duality,
edge-cut/girth duality, and the inductive existence of colourings on smaller cubic
graphs). The load-bearing claim is step (6): the compatibility of the two
boundary colourings across the cut. The parity of colours along an edge cut in a
$3$-edge-colouring is constrained, and the goal is to show these constraints can
always be satisfied simultaneously on both sides.
\end{remark}
\section{Step 1: The minimal counterexample}
\section{The minimal counterexample}
Throughout, a \emph{triangulation} is a simple plane graph, with a fixed
embedding, in which every face --- including the outer face --- is bounded by a
triangle. We first reduce to triangulations, then record the degree and
connectivity properties a smallest counterexample must have.
triangle. We first reduce to triangulations, then record the degree properties a
smallest counterexample must have.
\begin{lemma}[Reduction to triangulations]
\label{lem:triangulate}
@@ -169,78 +115,4 @@ $G$, a contradiction.
Hence $\delta(G) \ge 5$.
\end{proof}
For the connectivity reduction we recall that, in a triangulation, the relevant
small separators are short cycles.
\begin{definition}[Separating cycle]
A cycle $C$ in a triangulation $G$ is \emph{separating} if it is not a face
boundary; equivalently, both the open interior and the open exterior of $C$ (with
respect to the embedding) contain at least one vertex of $G$.
\end{definition}
\begin{lemma}[No separating triangle]
\label{lem:no-sep-tri}
A minimal counterexample $G$ has no separating triangle; consequently $G$ is
$4$-connected.
\end{lemma}
\begin{proof}
Suppose $T = xyz$ is a separating triangle. It splits $G$ into the triangulation
$G_{\mathrm{in}}$ induced by $T$ and the vertices interior to $T$, and the
triangulation $G_{\mathrm{out}}$ induced by $T$ and the vertices exterior to $T$;
in each, $T$ bounds a face. Both are triangulations on fewer vertices than $G$,
so by minimality each has a proper $4$-colouring. Permuting colours in
$G_{\mathrm{out}}$, we may assume the two colourings agree on $\{x,y,z\}$ (the
three corners receive distinct colours in each, so a colour permutation aligns
them). The two colourings then glue to a proper $4$-colouring of $G$, a
contradiction. A triangulation with no separating triangle and $\delta \ge 5$ is
$4$-connected, since a minimal vertex cut of size $\le 3$ in a triangulation is
the vertex set of a separating cycle of that length, and a $3$-cut would give a
separating triangle.
\end{proof}
\begin{proposition}[$5$-connectivity]
\label{prop:5conn}
A minimal counterexample $G$ may be taken to be $5$-connected; equivalently, $G$
has no separating triangle and no separating $4$-cycle.
\end{proposition}
\begin{proof}[Discussion]
By Lemma~\ref{lem:no-sep-tri} it remains to eliminate separating $4$-cycles. This
is the classical reducibility step of Birkhoff: a shortest separating $4$-cycle
$C = w x y z$ bounds inner and outer triangulations; one $4$-colours both by
minimality and reconciles their colourings on $C$ using Kempe-chain exchanges,
the only obstruction being the two ways the four corners can be coloured with
three or four colours. Carrying out the exchanges shows the colourings can always
be aligned, so $G$ has no separating $4$-cycle. As with
Lemma~\ref{lem:no-sep-tri}, the absence of separating $3$- and $4$-cycles in a
triangulation with $\delta \ge 5$ is equivalent to $5$-connectivity. We take this
reduction as standard and refer to the literature on the Four Colour Theorem for
the detailed Kempe-chain bookkeeping.
\end{proof}
The output of this step --- a $5$-connected triangulation $G$ with $\delta(G) \ge
5$ and no separating triangle or $4$-cycle --- is exactly the hypothesis the dual
construction of Step~2 consumes.
\section{Step 2: The dual cubic graph}
% TODO.
\section{Step 3: The minimum edge cut}
% TODO.
\section{Step 4: Capping to cubic planar graphs}
% TODO.
\section{Step 5: Colouring the pieces}
% TODO.
\section{Step 6: Reconnecting the colourings}
% TODO. (The crux.)
\end{document}