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

coloring_nested_tire_graphs: chain pigeonhole on pendant-redefined cut tires

Browse Source 
New note cut_tire_chain_pigeonhole.tex (4 pages) examining what
chain pigeonhole looks like under the redefined cut tire (face
boundary + labelled pendants).

KEY CHANGE: each cut tire is now structurally isomorphic to a partial
tire dual D(T), so all results from paper.tex / rainbow_proof.tex /
worst_case_proof_sketch.tex / k9_surviving_partitions.tex transfer
directly without re-derivation.

ARGUMENT SHAPE:
  Setup: min counterexample G', 6-edge cut, depth labelling, cut
  tires at each depth.

  Reduction: minimality ⇒ G'_i 3-edge-colorable ⇒ boundary
  configurations σ_0, σ_1.

  Layered: σ_i = π_out({T_1^{(i, f)}}). Chain compatibility:
  out spoke of T_d ↔ face boundary edge of T_{d-1} via the
  parent-graph correspondence.

  Pigeonhole: if at each layer the projection support contains
  S_3-symmetric structure, the chain propagates and forces
  R_0 ∩ R_1 ≠ ∅.

WHAT'S NEW UNDER THE REDEFINITION:
  1. Direct result transfer: cut tires LITERALLY are partial tire
     duals; no translation overhead.
  2. Cubicity restored: face-boundary vertices have degree 3 in the
     cut tire (degree 2 in H_d + 1 pendant).
  3. Combinatorial rigidity: cut tire data = face + degree-2 boundary
     vertices + in/out classification.

WHAT STAYS OPEN:
  (a) Chain pigeonhole at each layer: same conjectures (rainbow,
      König-lift) gate the argument.
  (b) Chain well-definedness: trivial H_d faces (length 2),
      degree-> 2 boundary vertices not getting pendants.
  (c) Depth-by-depth variability: no uniform bound on |π_out|
      across depths.

ASSESSMENT: strict improvement over the previous cut tire definition
(no transfer overhead, cubicity restored), but the hard step
remains the same as in the partial-tire-dual framework.

Concrete next step: cut-tire analogue of tire_fiber_step2 — for
each Holton-McKay graph, build cut tire chains on both sides of a
6-cut and check R_0 ∩ R_1 empirically.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
This commit is contained in:
didericis
2026-05-26 16:00:15 -04:00
parent cb6a79f799
commit 7cd1f0d08d
4 changed files with 594 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
papers/coloring_nested_tire_graphs/notes/cut_tire_chain_pigeonhole.aux
+3
View File
@@ -0,0 +1,3 @@
\relax
\@writefile{toc}{\contentsline {paragraph}{Concrete next step.}{4}{}\protected@file@percent }
\gdef \@abspage@last{4}
papers/coloring_nested_tire_graphs/notes/cut_tire_chain_pigeonhole.log
+347
View File
@@ -0,0 +1,347 @@
This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 26 MAY 2026 16:00
entering extended mode
restricted \write18 enabled.
%&-line parsing enabled.
**cut_tire_chain_pigeonhole.tex
(./cut_tire_chain_pigeonhole.tex
LaTeX2e <2021-11-15> patch level 1
L3 programming layer <2022-02-24>
(/usr/local/texlive/2022/texmf-dist/tex/latex/base/article.cls
Document Class: article 2021/10/04 v1.4n Standard LaTeX document class
(/usr/local/texlive/2022/texmf-dist/tex/latex/base/size11.clo
File: size11.clo 2021/10/04 v1.4n Standard LaTeX file (size option)
)
\c@part=\count185
\c@section=\count186
\c@subsection=\count187
\c@subsubsection=\count188
\c@paragraph=\count189
\c@subparagraph=\count190
\c@figure=\count191
\c@table=\count192
\abovecaptionskip=\skip47
\belowcaptionskip=\skip48
\bibindent=\dimen138
)
(/usr/local/texlive/2022/texmf-dist/tex/latex/amsmath/amsmath.sty
Package: amsmath 2021/10/15 v2.17l AMS math features
\@mathmargin=\skip49
For additional information on amsmath, use the `?' option.
(/usr/local/texlive/2022/texmf-dist/tex/latex/amsmath/amstext.sty
Package: amstext 2021/08/26 v2.01 AMS text
(/usr/local/texlive/2022/texmf-dist/tex/latex/amsmath/amsgen.sty
File: amsgen.sty 1999/11/30 v2.0 generic functions
\@emptytoks=\toks16
\ex@=\dimen139
))
(/usr/local/texlive/2022/texmf-dist/tex/latex/amsmath/amsbsy.sty
Package: amsbsy 1999/11/29 v1.2d Bold Symbols
\pmbraise@=\dimen140
)
(/usr/local/texlive/2022/texmf-dist/tex/latex/amsmath/amsopn.sty
Package: amsopn 2021/08/26 v2.02 operator names
)
\inf@bad=\count193
LaTeX Info: Redefining \frac on input line 234.
\uproot@=\count194
\leftroot@=\count195
LaTeX Info: Redefining \overline on input line 399.
\classnum@=\count196
\DOTSCASE@=\count197
LaTeX Info: Redefining \ldots on input line 496.
LaTeX Info: Redefining \dots on input line 499.
LaTeX Info: Redefining \cdots on input line 620.
\Mathstrutbox@=\box50
\strutbox@=\box51
\big@size=\dimen141
LaTeX Font Info: Redeclaring font encoding OML on input line 743.
LaTeX Font Info: Redeclaring font encoding OMS on input line 744.
\macc@depth=\count198
\c@MaxMatrixCols=\count199
\dotsspace@=\muskip16
\c@parentequation=\count266
\dspbrk@lvl=\count267
\tag@help=\toks17
\row@=\count268
\column@=\count269
\maxfields@=\count270
\andhelp@=\toks18
\eqnshift@=\dimen142
\alignsep@=\dimen143
\tagshift@=\dimen144
\tagwidth@=\dimen145
\totwidth@=\dimen146
\lineht@=\dimen147
\@envbody=\toks19
\multlinegap=\skip50
\multlinetaggap=\skip51
\mathdisplay@stack=\toks20
LaTeX Info: Redefining \[ on input line 2938.
LaTeX Info: Redefining \] on input line 2939.
)
(/usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/amssymb.sty
Package: amssymb 2013/01/14 v3.01 AMS font symbols
(/usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/amsfonts.sty
Package: amsfonts 2013/01/14 v3.01 Basic AMSFonts support
\symAMSa=\mathgroup4
\symAMSb=\mathgroup5
LaTeX Font Info: Redeclaring math symbol \hbar on input line 98.
LaTeX Font Info: Overwriting math alphabet `\mathfrak' in version `bold'
(Font) U/euf/m/n --> U/euf/b/n on input line 106.
))
(/usr/local/texlive/2022/texmf-dist/tex/latex/amscls/amsthm.sty
Package: amsthm 2020/05/29 v2.20.6
\thm@style=\toks21
\thm@bodyfont=\toks22
\thm@headfont=\toks23
\thm@notefont=\toks24
\thm@headpunct=\toks25
\thm@preskip=\skip52
\thm@postskip=\skip53
\thm@headsep=\skip54
\dth@everypar=\toks26
)
(/usr/local/texlive/2022/texmf-dist/tex/latex/graphics/graphicx.sty
Package: graphicx 2021/09/16 v1.2d Enhanced LaTeX Graphics (DPC,SPQR)
(/usr/local/texlive/2022/texmf-dist/tex/latex/graphics/keyval.sty
Package: keyval 2014/10/28 v1.15 key=value parser (DPC)
\KV@toks@=\toks27
)
(/usr/local/texlive/2022/texmf-dist/tex/latex/graphics/graphics.sty
Package: graphics 2021/03/04 v1.4d Standard LaTeX Graphics (DPC,SPQR)
(/usr/local/texlive/2022/texmf-dist/tex/latex/graphics/trig.sty
Package: trig 2021/08/11 v1.11 sin cos tan (DPC)
)
(/usr/local/texlive/2022/texmf-dist/tex/latex/graphics-cfg/graphics.cfg
File: graphics.cfg 2016/06/04 v1.11 sample graphics configuration
)
Package graphics Info: Driver file: pdftex.def on input line 107.
(/usr/local/texlive/2022/texmf-dist/tex/latex/graphics-def/pdftex.def
File: pdftex.def 2020/10/05 v1.2a Graphics/color driver for pdftex
))
\Gin@req@height=\dimen148
\Gin@req@width=\dimen149
)
(/usr/local/texlive/2022/texmf-dist/tex/latex/geometry/geometry.sty
Package: geometry 2020/01/02 v5.9 Page Geometry
(/usr/local/texlive/2022/texmf-dist/tex/generic/iftex/ifvtex.sty
Package: ifvtex 2019/10/25 v1.7 ifvtex legacy package. Use iftex instead.
(/usr/local/texlive/2022/texmf-dist/tex/generic/iftex/iftex.sty
Package: iftex 2022/02/03 v1.0f TeX engine tests
))
\Gm@cnth=\count271
\Gm@cntv=\count272
\c@Gm@tempcnt=\count273
\Gm@bindingoffset=\dimen150
\Gm@wd@mp=\dimen151
\Gm@odd@mp=\dimen152
\Gm@even@mp=\dimen153
\Gm@layoutwidth=\dimen154
\Gm@layoutheight=\dimen155
\Gm@layouthoffset=\dimen156
\Gm@layoutvoffset=\dimen157
\Gm@dimlist=\toks28
)
(/usr/local/texlive/2022/texmf-dist/tex/latex/booktabs/booktabs.sty
Package: booktabs 2020/01/12 v1.61803398 Publication quality tables
\heavyrulewidth=\dimen158
\lightrulewidth=\dimen159
\cmidrulewidth=\dimen160
\belowrulesep=\dimen161
\belowbottomsep=\dimen162
\aboverulesep=\dimen163
\abovetopsep=\dimen164
\cmidrulesep=\dimen165
\cmidrulekern=\dimen166
\defaultaddspace=\dimen167
\@cmidla=\count274
\@cmidlb=\count275
\@aboverulesep=\dimen168
\@belowrulesep=\dimen169
\@thisruleclass=\count276
\@lastruleclass=\count277
\@thisrulewidth=\dimen170
)
(/usr/local/texlive/2022/texmf-dist/tex/latex/l3backend/l3backend-pdftex.def
File: l3backend-pdftex.def 2022-02-07 L3 backend support: PDF output (pdfTeX)
\l__color_backend_stack_int=\count278
\l__pdf_internal_box=\box52
)
(./cut_tire_chain_pigeonhole.aux)
\openout1 = `cut_tire_chain_pigeonhole.aux'.
LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 17.
LaTeX Font Info: ... okay on input line 17.
LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 17.
LaTeX Font Info: ... okay on input line 17.
LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 17.
LaTeX Font Info: ... okay on input line 17.
LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 17.
LaTeX Font Info: ... okay on input line 17.
LaTeX Font Info: Checking defaults for TS1/cmr/m/n on input line 17.
LaTeX Font Info: ... okay on input line 17.
LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 17.
LaTeX Font Info: ... okay on input line 17.
LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 17.
LaTeX Font Info: ... okay on input line 17.
(/usr/local/texlive/2022/texmf-dist/tex/context/base/mkii/supp-pdf.mkii
[Loading MPS to PDF converter (version 2006.09.02).]
\scratchcounter=\count279
\scratchdimen=\dimen171
\scratchbox=\box53
\nofMPsegments=\count280
\nofMParguments=\count281
\everyMPshowfont=\toks29
\MPscratchCnt=\count282
\MPscratchDim=\dimen172
\MPnumerator=\count283
\makeMPintoPDFobject=\count284
\everyMPtoPDFconversion=\toks30
) (/usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty
Package: epstopdf-base 2020-01-24 v2.11 Base part for package epstopdf
Package epstopdf-base Info: Redefining graphics rule for `.eps' on input line 4
85.
(/usr/local/texlive/2022/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg
File: epstopdf-sys.cfg 2010/07/13 v1.3 Configuration of (r)epstopdf for TeX Liv
e
))
*geometry* driver: auto-detecting
*geometry* detected driver: pdftex
*geometry* verbose mode - [ preamble ] result:
* driver: pdftex
* paper: <default>
* layout: <same size as paper>
* layoutoffset:(h,v)=(0.0pt,0.0pt)
* modes:
* h-part:(L,W,R)=(72.26999pt, 469.75502pt, 72.26999pt)
* v-part:(T,H,B)=(72.26999pt, 650.43001pt, 72.26999pt)
* \paperwidth=614.295pt
* \paperheight=794.96999pt
* \textwidth=469.75502pt
* \textheight=650.43001pt
* \oddsidemargin=0.0pt
* \evensidemargin=0.0pt
* \topmargin=-37.0pt
* \headheight=12.0pt
* \headsep=25.0pt
* \topskip=11.0pt
* \footskip=30.0pt
* \marginparwidth=59.0pt
* \marginparsep=10.0pt
* \columnsep=10.0pt
* \skip\footins=10.0pt plus 4.0pt minus 2.0pt
* \hoffset=0.0pt
* \voffset=0.0pt
* \mag=1000
* \@twocolumnfalse
* \@twosidefalse
* \@mparswitchfalse
* \@reversemarginfalse
* (1in=72.27pt=25.4mm, 1cm=28.453pt)
LaTeX Font Info: Trying to load font information for U+msa on input line 18.
(/usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsa.fd
File: umsa.fd 2013/01/14 v3.01 AMS symbols A
)
LaTeX Font Info: Trying to load font information for U+msb on input line 18.
(/usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsb.fd
File: umsb.fd 2013/01/14 v3.01 AMS symbols B
)
! LaTeX Error: Unicode character ⇒ (U+21D2)
not set up for use with LaTeX.
See the LaTeX manual or LaTeX Companion for explanation.
Type H <return> for immediate help.
...
l.49 counterexample ⇒
$\mathcal{R}_0 \cap \mathcal{R}_1 = \emptyset$.
You may provide a definition with
\DeclareUnicodeCharacter
Overfull \hbox (2.10077pt too wide) in paragraph at lines 79--84
[]\OT1/cmr/m/n/10.95 This is the chain com-pat-i-bil-ity con-straint: $\OML/cmm
/m/it/10.95 T[]$\OT1/cmr/m/n/10.95 's out-spoke pro-jec-tion $\OML/cmm/m/it/10.
95 ^^Y[]\OT1/cmr/m/n/10.95 (\OML/cmm/m/it/10.95 T[]\OT1/cmr/m/n/10.95 ) \OMS/cm
sy/m/n/10.95 ^^R f\OT1/cmr/m/n/10.95 1\OML/cmm/m/it/10.95 ; \OT1/cmr/m/n/10.95
2\OML/cmm/m/it/10.95 ; \OT1/cmr/m/n/10.95 3\OMS/cmsy/m/n/10.95 g[]$
[]
[1
{/usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map}]
! LaTeX Error: Unicode character ↔ (U+2194)
not set up for use with LaTeX.
See the LaTeX manual or LaTeX Companion for explanation.
Type H <return> for immediate help.
...
l.85 Symmetrically: in spokes of $T_d$ ↔
specific face-boundary edges of
You may provide a definition with
\DeclareUnicodeCharacter
Overfull \hbox (0.66916pt too wide) in paragraph at lines 95--99
[]\OT1/cmr/bx/n/10.95 Proposition 1.13 (edge--vertex col-or-ing bi-jec-tion): \
OT1/cmr/m/n/10.95 For spoke-only cut tires (face bound-
[]
LaTeX Font Info: Font shape `OT1/cmtt/bx/n' in size <10.95> not available
(Font) Font shape `OT1/cmtt/m/n' tried instead on input line 103.
Overfull \hbox (5.55577pt too wide) in paragraph at lines 109--112
[]\OT1/cmr/bx/n/10.95 Face-pair-connection struc-tural de-scrip-tion (\OT1/cmtt
/m/n/10.95 k9[]surviving[]partitions.tex\OT1/cmr/bx/n/10.95 ): \OT1/cmr/m/n/10.
95 Cut tires
[]
[2] [3] [4] (./cut_tire_chain_pigeonhole.aux) )
Here is how much of TeX's memory you used:
3247 strings out of 478268
48400 string characters out of 5846347
349617 words of memory out of 5000000
21436 multiletter control sequences out of 15000+600000
477826 words of font info for 60 fonts, out of 8000000 for 9000
1141 hyphenation exceptions out of 8191
55i,5n,62p,242b,218s stack positions out of 10000i,1000n,20000p,200000b,200000s
{/usr/local/texlive/2022/texmf-d
ist/fonts/enc/dvips/cm-super/cm-super-ts1.enc}</usr/local/texlive/2022/texmf-di
st/fonts/type1/public/amsfonts/cm/cmbx10.pfb></usr/local/texlive/2022/texmf-dis
t/fonts/type1/public/amsfonts/cm/cmbx12.pfb></usr/local/texlive/2022/texmf-dist
/fonts/type1/public/amsfonts/cm/cmmi10.pfb></usr/local/texlive/2022/texmf-dist/
fonts/type1/public/amsfonts/cm/cmmi8.pfb></usr/local/texlive/2022/texmf-dist/fo
nts/type1/public/amsfonts/cm/cmr10.pfb></usr/local/texlive/2022/texmf-dist/font
s/type1/public/amsfonts/cm/cmr17.pfb></usr/local/texlive/2022/texmf-dist/fonts/
type1/public/amsfonts/cm/cmr6.pfb></usr/local/texlive/2022/texmf-dist/fonts/typ
e1/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/p
ublic/amsfonts/cm/cmsy6.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/pub
lic/amsfonts/cm/cmsy8.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/publi
c/amsfonts/cm/cmti10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public
/amsfonts/cm/cmtt10.pfb></usr/local/texlive/2022/texmf-dist/fonts/type1/public/
cm-super/sfrm1095.pfb>
Output written on cut_tire_chain_pigeonhole.pdf (4 pages, 182817 bytes).
PDF statistics:
88 PDF objects out of 1000 (max. 8388607)
53 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/coloring_nested_tire_graphs/notes/cut_tire_chain_pigeonhole.pdf
BIN
View File
Binary file not shown.
papers/coloring_nested_tire_graphs/notes/cut_tire_chain_pigeonhole.tex
+244
View File
@@ -0,0 +1,244 @@
\documentclass[11pt]{article}
\usepackage{amsmath,amssymb,amsthm}
\usepackage{graphicx}
\usepackage{geometry}
\usepackage{booktabs}
\geometry{margin=1in}
\title{Chain pigeonhole on cut tires (pendant-redefined version)}
\author{}
\date{}
\newtheorem*{prop}{Proposition}
\newtheorem*{lem}{Lemma}
\newtheorem*{conj}{Conjecture}
\newtheorem*{obs}{Observation}
\begin{document}
\maketitle
\section*{Setup recap}
Take $G'$ the cubic planar dual of a maximal planar graph $G$.
Suppose $G'$ is a minimum counterexample to 4CT. Pick a $6$-edge
cut $C \subseteq E(G')$ (a matching cut), form $G'_0, G'_1$ with
pendant edges as in \texttt{cut\_depth\_label.tex}, BFS-label edges
by depth from the pendants.
The crucial change under the \emph{redefined} cut tire definition:
each cut tire $T_d^{(i, f)}$ is structurally isomorphic to a partial
tire dual $D(T)$ in \texttt{paper.tex}. Its face boundary is the
$T'_{\mathrm{ann}}$-analogue, and its labelled pendants (out spokes
at degree-$2$ vertices incident to a depth-$(d-1)$ edge; in spokes
for depth-$(d+1)$) are the analogue of $D(T)$'s leaves.
\section*{The chain pigeonhole argument}
\subsection*{Reduction by minimality}
By minimality of $G'$, each $G'_i$ (after pendant addition) is
strictly smaller than $G'$ and admits a proper $3$-edge-colouring
$\chi_i : E(G'_i) \to \{1, 2, 3\}$. Restricting $\chi_i$ to the $6$
depth-$0$ pendants gives a boundary configuration $\sigma_i \in
\{1, 2, 3\}^6$.
A proper $3$-edge-colouring of $G'$ exists iff some $\sigma$ is
achievable as both $\sigma_0$ and $\sigma_1$, i.e.\
$\mathcal{R}_0 \cap \mathcal{R}_1 \neq \emptyset$ where
$\mathcal{R}_i := \{\sigma_i \mid \chi_i \text{ proper}\}$. $G'$ a
counterexample ⇒ $\mathcal{R}_0 \cap \mathcal{R}_1 = \emptyset$.
\subsection*{Layered decomposition via cut tires}
The depth-$0$ pendants of $G'_i$ are precisely the \emph{out spokes}
of the cut tires at depth $1$ (one out spoke per depth-$0$ edge).
So $\sigma_i = \pi_{\mathrm{out}}(\{T_1^{(i, f)}\})$, where
$\pi_{\mathrm{out}}$ projects the global colouring onto all out
spokes of depth-$1$ cut tires combined.
More generally, the cut-tire chain at depths $d = 1, 2, \ldots,
d_{\max}$ partitions the edges of $G'_i$ by depth. Each cut tire
$T_d^{(i, f)}$ has $\chi_i$-restricted colouring that:
\begin{itemize}
\item Properly colours the face boundary (a closed walk in $H_d$),
\item Colours out spokes (representing depth-$(d-1)$ edges in
$G'_i$),
\item Colours in spokes (representing depth-$(d+1)$ edges).
\end{itemize}
\subsection*{Compatibility between adjacent tire layers}
An out spoke of $T_d$ at boundary vertex $v$ represents a specific
depth-$(d-1)$ edge $e^* = vw$ in $G'_i$. This edge $e^*$ is a
\emph{face boundary edge} of some cut tire at depth $d - 1$ (since
$e^*$ has depth $d - 1$ and so lies in $H_{d-1}$).
Therefore: the colour of an out spoke at depth $d$ equals the colour
of the corresponding face boundary edge at depth $d - 1$.
This is the chain compatibility constraint: $T_d$'s out-spoke
projection $\pi_{\mathrm{out}}(T_d) \subseteq \{1, 2, 3\}^{|\text{out
spokes}|}$ corresponds, via the bijection $\{\text{out spokes of }
T_d\} \to \{\text{specific edges on face boundaries of } T_{d-1}
\text{'s}\}$, to a projection of $T_{d-1}$'s face-boundary colouring.
Symmetrically: in spokes of $T_d$ ↔ specific face-boundary edges of
some $T_{d+1}$.
\subsection*{Result inheritance via the partial-tire-dual identification}
Because each cut tire \emph{is} a partial tire dual (up to graph
isomorphism), every counting/structural result for $D(T)$ in
\texttt{paper.tex} applies directly:
\begin{itemize}
\item \textbf{Proposition 1.13 (edge--vertex coloring bijection):}
For spoke-only cut tires (face boundary a simple cycle of
length $n$, all $n$ spokes pendant), the number of proper
$3$-edge-colourings is $2^n + 2(-1)^n$.
\item \textbf{Definitions 1.15--1.17:} The face boundary plays the
role of $T'_{\mathrm{ann}}$; the spokes play the role of the
tire annular face connector $T'_{f'}$ and its inner/outer
spokes.
\item \textbf{Rainbow conjecture (\texttt{rainbow\_proof.tex}):}
For cut tires whose face boundary has the antipodal-chord SP
structure, the spoke projection support equals the
perms-per-face set $\mathcal{P}_m$, conditional on
Conjecture~1.5.
\item \textbf{Face-pair-connection structural description
(\texttt{k9\_surviving\_partitions.tex}):} Cut tires with
$r$ all-$3$ face structure admit exactly $2^r$ valid
``induced partitions'' for König-lift purposes.
\end{itemize}
These results provide quantitative bounds on $\pi_{\mathrm{in}}$ and
$\pi_{\mathrm{out}}$ at each layer.
\subsection*{The chain pigeonhole step}
For the chain $T_1 \to T_2 \to \cdots \to T_{d_{\max}}$ on side $i$:
\begin{itemize}
\item At the deep interior (depth $d_{\max}$), $T_{d_{\max}}$'s in
spokes either don't exist or terminate at the deepest
vertex. In the example $G'_1$ of Holton-McKay \#0,
$T_6$ has $2$ in spokes still going somewhere, but the chain
does eventually terminate.
\item Each $T_d$ constrains $T_{d-1}$ and $T_{d+1}$ via the
in/out-spoke correspondence with face boundary edges.
\item $\mathcal{R}_i = \pi_{\mathrm{out}}(\{T_1^{(i, f)}\})$
as restricted by the chain of compatibility conditions
running from depth $1$ inward to $d_{\max}$.
\end{itemize}
Chain pigeonhole says: if at each layer the realisable projection
contains enough structure (e.g.\ a full $S_3$-orbit), the chain
condition propagates through and yields a non-empty $\mathcal{R}_i$
of substantial size. If both $\mathcal{R}_0$ and $\mathcal{R}_1$
contain a common $S_3$-orbit, they intersect, contradicting that
$G'$ is a counterexample.
\section*{What's actually new under the redefinition}
\subsection*{1. Direct result transfer}
Previously (with the original cut tire definition involving incident
edges in $G'_i$): we had to re-derive each result for cut tires,
because cut tires weren't formally $D(T)$.
Now: each cut tire \emph{is} $D(T)$ for some virtual tire $T$, so
Prop 1.13, the rainbow proof, the König-lift framework, all apply
without re-derivation.
\subsection*{2. Cubicity restored at face-boundary vertices}
Each face-boundary vertex of a cut tire has degree $2$ (in $H_d$) +
$1$ pendant (in spoke or out spoke) $= 3$ in the cut tire. So
\emph{cut tires are cubic} (at face-boundary vertices), restoring
the cubic structure that the previous definition broke (where $H_d$
was not cubic).
This means classical cubic-graph results (König, Tait, chromatic
polynomial of $L(C_n)$, etc.) apply directly.
\subsection*{3. The chain-defined structure is more rigid}
Under the previous definition, ``the cut tire'' included variable
numbers of incident edges depending on $G'_i$'s local structure.
Under the new definition, the cut tire is determined by:
\begin{itemize}
\item The face $f$ (in $H_d$).
\item Which of $f$'s boundary vertices are degree-$2$ in $H_d$.
\item For each such vertex, whether its non-$H_d$ neighbour is at
depth $d - 1$ or $d + 1$.
\end{itemize}
This is finite, combinatorial, and exactly the data needed for
chain compatibility.
\section*{What stays open}
The fundamental obstacles \emph{don't} change:
\subsection*{(a) Chain pigeonhole at each layer}
The same open conjectures (rainbow, König-lift, 2-SAT solvability)
gate the chain argument. They now apply to cut tires directly
rather than via translation, but their statements are unchanged.
\subsection*{(b) Chain well-definedness}
\begin{itemize}
\item Each $H_d$ must have $\ge 1$ face. Empirically this holds in
the Holton-McKay example at all depths $1$--$7$, but no
general guarantee.
\item Some $H_d$ faces have length $2$ (just a single edge of
$H_d$ with two adjacent faces sharing it). These ``trivial''
cut tires have empty face boundary cycle interior and
contribute very little structure.
\item Some boundary vertices have degree $> 2$ in $H_d$
(cut-vertices or branch points of $H_d$); these don't get
pendants under the strict reading. The cut tire then has
fewer than $|f|$ spokes.
\end{itemize}
\subsection*{(c) Chain length and depth-by-depth variability}
In the example, the chain has variable face counts ($1$--$3$) and
face lengths ($2$--$14$) across depths. A uniform bound on
$|\pi_{\mathrm{out}}|$ across depths still seems unlikely; the chain
would have to handle depth-by-depth structure individually.
\section*{Net assessment}
The redefinition (cut tire $=$ face boundary $+$ labelled pendants
at degree-$2$ vertices) is a \textbf{strict improvement} over the
previous formulation, because:
\begin{enumerate}
\item It identifies each cut tire with a partial tire dual
$D(T)$, so all results from \texttt{paper.tex} and downstream
notes transfer directly.
\item It restores cubicity at face-boundary vertices, which the
previous definition broke.
\item The data needed for chain compatibility (face $f$, degree-$2$
boundary vertices, in/out classification) is finite and
combinatorial.
\end{enumerate}
But the fundamental hard step is unchanged: chain pigeonhole at
each layer reduces to the same open conjectures (rainbow / König-
lift) that gate the partial-tire-dual chain pigeonhole. The
redefinition doesn't make those easier; it makes the transfer free
of charge.
\paragraph{Concrete next step.} Empirically verify on the $6$
Holton-McKay graphs: for each, pick a matching $6$-cut, build cut
tire chains on both sides, compute $\mathcal{R}_0$ and
$\mathcal{R}_1$, check whether $\mathcal{R}_0 \cap \mathcal{R}_1
\neq \emptyset$. By 4CT (which we're \emph{not} assuming for the
proof) we know it does; the question is whether the cut-tire chain
machinery successfully identifies the overlap structurally, or
whether (after composition) the chain pigeonhole inequality fails
empirically. This is the analogue of \texttt{tire\_fiber\_step2.tex}
for the cut-tire setting.
\end{document}