Add edge-deletion subgraph 4-colorability for a minimal counterexample

Defines D(G) as the family of single-edge-deletion spanning subgraphs
of a maximal planar graph G, and shows that when G_0 is a minimum-order
5-chromatic maximal planar graph every member of D(G_0) is 4-colorable,
via a coloring pulled back from the smaller minor G_0/uv.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
This commit is contained in:
2026-05-14 00:27:11 -04:00
parent bd409585ba
commit f6144b98b5
6 changed files with 53 additions and 15 deletions
@@ -8,10 +8,13 @@
\newlabel{thm:min-five-chromatic-not-flip-symmetric}{{4.1}{2}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{5}{Flip symmetry frequency}}{2}{}\protected@file@percent }
\newlabel{sec:frequency}{{5}{2}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{6}{Further necessary properties of a minimal counterexample}}{3}{}\protected@file@percent }
\newlabel{tocindent-1}{0pt}
\newlabel{tocindent0}{0pt}
\newlabel{tocindent1}{17.77782pt}
\newlabel{tocindent2}{0pt}
\newlabel{tocindent3}{0pt}
\@writefile{toc}{\contentsline {section}{\tocsection {}{6}{Further necessary properties of a minimal counterexample}}{3}{}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\tocsection {}{7}{Edge-deletion subgraphs}}{4}{}\protected@file@percent }
\newlabel{def:edge-deletion}{{7.1}{4}}
\newlabel{thm:edge-deletion-4colorable}{{7.2}{4}}
\gdef \@abspage@last{4}