%% filename: amsart-template.tex
%% American Mathematical Society
%% AMS-LaTeX v.2 template for use with amsart
%% ====================================================================

\documentclass{amsart}

\usepackage{amssymb}
\usepackage{graphicx}

\newtheorem{theorem}{Theorem}[section]
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{proposition}[theorem]{Proposition}

\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{example}[theorem]{Example}

\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}

\numberwithin{equation}{section}

\begin{document}

\title{Dual Decomposition of Minimal Counterexamples}

%    author one information
\author{Eric Bauerfeld}
\address{}
\curraddr{}
\email{}
\thanks{}

\subjclass[2010]{Primary }

\keywords{four colour theorem, plane triangulation, dual graph, cubic planar
graph, edge connectivity, cyclic edge cut, Tait colouring, $3$-edge-colouring}

\date{}

\dedicatory{}

\begin{abstract}
% TODO: abstract.
\end{abstract}

\maketitle

\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 properties a
smallest counterexample must have.

\begin{lemma}[Reduction to triangulations]
\label{lem:triangulate}
If every triangulation is properly $4$-vertex-colourable, then so is every plane
graph.
\end{lemma}

\begin{proof}
Let $H$ be a plane graph. Add edges to $H$, maintaining planarity, until no
further edge can be added; the result is a triangulation $H^{+}$ on the same
vertex set with $E(H) \subseteq E(H^{+})$. A proper $4$-colouring of $H^{+}$
restricts to a proper $4$-colouring of $H$, since every edge of $H$ is an edge of
$H^{+}$.
\end{proof}

By Lemma~\ref{lem:triangulate}, if the Four Colour Theorem fails then it fails for
some triangulation. We may therefore make the following assumption.

\begin{definition}[Minimal counterexample]
\label{def:minimal}
Let $G$ be a triangulation on the fewest vertices that admits no proper
$4$-vertex-colouring. We call $G$ a \emph{minimal counterexample}. By minimality,
every triangulation on fewer than $|V(G)|$ vertices is properly
$4$-colourable.
\end{definition}

\begin{remark}
Since every triangulation on at most four vertices is properly $4$-colourable
(the largest being $K_4$), a minimal counterexample has $|V(G)| \ge 5$; the degree
bound below sharpens this to $|V(G)| \ge 12$.
\end{remark}

\begin{lemma}[Minimum degree]
\label{lem:mindeg}
A minimal counterexample $G$ has minimum degree $\delta(G) \ge 5$.
\end{lemma}

\begin{proof}
Suppose some vertex $v$ has $\deg(v) = d \le 4$.

If $d \le 3$, let $G' = G - v$. Then $G'$ is a plane graph on fewer vertices, so
by Definition~\ref{def:minimal} and Lemma~\ref{lem:triangulate} it has a proper
$4$-colouring. The at most three neighbours of $v$ use at most three colours, so
a fourth colour is free for $v$, extending the colouring to $G$ --- a
contradiction.

If $d = 4$, again $4$-colour $G - v$. If the four neighbours of $v$ use at most
three colours we extend as before, so assume they receive all four colours; let
$v_1, v_2, v_3, v_4$ be the neighbours in cyclic order around $v$, coloured
$1,2,3,4$. Consider the subgraph induced by the colour classes $1$ and $3$, and
let $K$ be its connected component containing $v_1$. If $v_3 \notin K$, swap
colours $1$ and $3$ on $K$; now no neighbour of $v$ is coloured $1$, freeing it
for $v$. If $v_3 \in K$, then a $1$--$3$ Kempe chain joins $v_1$ to $v_3$, and
this chain together with $v$ encloses exactly one of $v_2, v_4$; hence the
$2$--$4$ component containing $v_2$ cannot also reach $v_4$, and swapping colours
$2$ and $4$ on it frees colour $2$ for $v$. Either way the colouring extends to
$G$, a contradiction.

Hence $\delta(G) \ge 5$.
\end{proof}

\end{document}